|
| |
|
|
A015456
|
|
Generalized Fibonacci numbers.
|
|
3
| |
|
|
1, 1, 11, 111, 1121, 11321, 114331, 1154631, 11660641, 117761041, 1189271051, 12010471551, 121293986561, 1224950337161, 12370797358171, 124932923918871, 1261700036546881, 12741933289387681
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n) = 10 a(n-1) + a(n-2).
a(n)=Sum_{k, 0<=k<=n}9^k*A055830(n,k) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 18 2006
a(n)=(1/2)*[5+sqrt(26)]^n-(1/13)*[5+sqrt(26)]^n*sqrt(26)+(1/2)*[5-sqrt(26)]^n+(1/13)*sqrt(26) *[5-sqrt(26)]^n, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Jul 15 2008
G.f.: (1-9*x)/(1-10*x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2008]
|
|
|
CROSSREFS
| Sequence in context: A097115 A134732 A166747 * A199764 A097177 A136982
Adjacent sequences: A015453 A015454 A015455 * A015457 A015458 A015459
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Olivier Gerard (olivier.gerard(AT)gmail.com)
|
| |
|
|
