Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015603
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A015603 a(n) = 11 a(n-1) + 9 a(n-2). +0
1
0, 1, 11, 130, 1529, 17989, 211640, 2489941, 29294111, 344644690, 4054738589, 47703926689, 561235840880, 6602929589881, 77683348056611, 913943194931650, 10752525276757649, 126503266798718989 (list; graph; listen)
OFFSET

0,3

FORMULA

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

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

PROGRAM

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

CROSSREFS

Adjacent sequences: A015600 A015601 A015602 this_sequence A015604 A015605 A015606

Sequence in context: A015601 A024144 A015602 this_sequence A157718 A046210 A100757

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 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research