|
Search: id:A087635
|
|
|
| A087635 |
|
a(n)=S(n,3) where S(n,m)=sum(k=0,n,binomial(n,k)*fibonacci(m*k)). |
|
+0
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; listen)
|
|
|
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 (ppl(AT)spl.at), Jun 25 2008
|
|
CROSSREFS
|
Cf. A001906 (S(n, 1)), A030191 (S(n, 2)).
Sequence in context: A125831 A026076 A006646 this_sequence A052896 A025599 A162973
Adjacent sequences: A087632 A087633 A087634 this_sequence A087636 A087637 A087638
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 23 2003
|
|
|
Search completed in 0.002 seconds
|
