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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087603 a(n)=(1/8)*sum(k=0,n,binomial(n,k)*Fibonacci(k)*8^k). 0
1, 10, 155, 2100, 29525, 410750, 5731375, 79905000, 1114275625, 15537531250, 216660471875, 3021168937500, 42128015328125, 587444444843750, 8191485291484375, 114224297381250000, 1592774664844140625 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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.

Sequence in context: A178298 A048907 A061654 * A129460 A200989 A087961

Adjacent sequences:  A087600 A087601 A087602 * A087604 A087605 A087606

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 25 2003

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 17 02:31 EST 2012. Contains 205978 sequences.