login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015457 Generalized Fibonacci numbers. 2
1, 1, 12, 133, 1475, 16358, 181413, 2011901, 22312324, 247447465, 2744234439, 30434026294, 337518523673, 3743137786697, 41512034177340, 460375513737437, 5105642685289147, 56622445051918054 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 11 a(n-1) + a(n-2).

a(n)=Sum_{k, 0<=k<=n}10^k*A055830(n,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 18 2006

a(n)=(9/50)*[11/2-(5/2)*sqrt(5)]^n*sqrt(5)+(1/2)*[11/2-(5/2)*sqrt(5)]^n-(9/50)*sqrt(5)*[11/2+(5 /2)*sqrt(5)]^n+(1/2)*[11/2+(5/2)*sqrt(5)]^n, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Jul 09 2008

G.f.: (1-10*x)/(1-11*x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 21 2008]

CROSSREFS

Sequence in context: A120673 A120674 A016123 * A015469 A144785 A199233

Adjacent sequences:  A015454 A015455 A015456 * A015458 A015459 A015460

KEYWORD

nonn,easy

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.