Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015602
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015602 a(n) = 11 a(n-1) + 8 a(n-2). +0
1
0, 1, 11, 129, 1507, 17609, 205755, 2404177, 28091987, 328245273, 3835433899, 44815735073, 523656556995, 6118748007529, 71495480538779, 835400269986801, 9761366814165043, 114058237115709881 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=(1/51)*sqrt(17)*[11/2+(3/2)*sqrt(17)]^n-(1/51)*[11/2-(3/2)*sqrt(17)]^n*sqrt(17), with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 09 2008

G.f.:1/(1-11*x-8*x^2) . [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 27 2009]

PROGRAM

(Other) sage: [lucas_number1(n, 11, -8) for n in xrange(0, 18)]# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 27 2009]

CROSSREFS

Sequence in context: A015598 A015601 A024144 this_sequence A015603 A157718 A046210

Adjacent sequences: A015599 A015600 A015601 this_sequence A015603 A015604 A015605

KEYWORD

nonn,easy

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research