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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087635 a(n)=S(n,3) where S(n,m)=sum(k=0,n,binomial(n,k)*fibonacci(m*k)). 2
0, 2, 12, 64, 336, 1760, 9216, 48256, 252672, 1323008, 6927360, 36272128, 189923328, 994451456, 5207015424, 27264286720, 142757658624, 747488804864, 3913902194688, 20493457948672, 107305138913280, 561857001684992 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(n)=6*a(n-1)-4*a(n-2)

a(n)=sum_{0<=j<=i<=n} binomial(i, j)*binomial(n, i)*F(i+j) - Benoit Cloitre (benoit7848c(AT)orange.fr), May 21 2005

a(n)=2^n*F(2n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 13 2005

a(n) = Sum[C(n,k)Fibonacci(k)Lucas(n-k),{k,0,n}]. - Ross La Haye (rlahaye(AT)new.rr.com), Aug 14 2006

a(n)=-(1/5)*[3-sqrt(5)]^n*sqrt(5)+(1/5)*sqrt(5)*[3+sqrt(5)]^n, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Jun 25 2008

CROSSREFS

Cf. A001906 (S(n, 1)), A030191 (S(n, 2)).

Sequence in context: A125831 A026076 A006646 * A180038 A052896 A190155

Adjacent sequences:  A087632 A087633 A087634 * A087636 A087637 A087638

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 23 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 14 22:37 EST 2012. Contains 205679 sequences.