|
Search: id:A087603
|
|
|
| A087603 |
|
a(n)=(1/8)*sum(k=0,n,binomial(n,k)*Fibonacci(k)*8^k). |
|
+0
1
|
|
| 1, 10, 155, 2100, 29525, 410750, 5731375, 79905000, 1114275625, 15537531250, 216660471875, 3021168937500, 42128015328125, 587444444843750, 8191485291484375, 114224297381250000, 1592774664844140625
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
More generally a(n)=(1/x)*sum(k=0,n,binomial(n,k)*Fibonacci(k)*x^k) satisfies the recurrence formula a(n)=(x+2)*a(n-1)+(x^2-x-1)*a(n-2).
|
|
FORMULA
|
a(n)=10*a(n-1)+55*a(n-2)
O.g.f.: -1/(-1+10*x+55*x^2). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 05 2007
|
|
CROSSREFS
|
Cf. A014445, A057088, A015553.
Adjacent sequences: A087600 A087601 A087602 this_sequence A087604 A087605 A087606
Sequence in context: A034325 A048907 A061654 this_sequence A129460 A087961 A116041
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 25 2003
|
|
|
Search completed in 0.002 seconds
|
