Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015601
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015601 a(n) = 11 a(n-1) + 7 a(n-2). +0
1
0, 1, 11, 128, 1485, 17231, 199936, 2319913, 26918595, 312343936, 3624213461, 42052755623, 487949806080, 5661817156241, 65695637361211, 762284731067008, 8845001503265565, 102631009653390271 (list; graph; listen)
OFFSET

0,3

FORMULA

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

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

PROGRAM

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

CROSSREFS

Sequence in context: A084975 A065543 A015598 this_sequence A024144 A015602 A015603

Adjacent sequences: A015598 A015599 A015600 this_sequence A015602 A015603 A015604

KEYWORD

nonn,easy

AUTHOR

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

page 1

Search completed in 0.004 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