Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015598
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015598 a(n) = 11 a(n-1) + 6 a(n-2). +0
1
0, 1, 11, 127, 1463, 16855, 194183, 2237143, 25773671, 296933239, 3420907655, 39411583639, 454052865959, 5231051027383, 60265878496967, 694310969630935, 7999015936922087, 92155041123928567 (list; graph; listen)
OFFSET

0,3

FORMULA

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

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

PROGRAM

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

CROSSREFS

Sequence in context: A053546 A084975 A065543 this_sequence A015601 A024144 A015602

Adjacent sequences: A015595 A015596 A015597 this_sequence A015599 A015600 A015601

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research