|
Search: id:A097040
|
|
|
| A097040 |
|
a(n)=2Sum(C(n,2k+1)F(2k), k=0,..,Floor[(n-1)/2}), where F(n) are Fibonacci numbers A000045. |
|
+0
1
|
|
| 0, 0, 2, 8, 26, 76, 212, 576, 1542, 4092, 10802, 28424, 74648, 195808, 513242, 1344672, 3521994, 9223284, 24151052, 63235040, 165562430, 433465780, 1134856802, 2971140048, 7778620656, 20364814656, 53315973362, 139583348216
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
a(n)=F(2n-1)-F(n+1).
|
|
MATHEMATICA
|
f[n_] := f[n] = f[n - 1] + f[n - 2]; f[0] = 0; f[1] = 1; Table[2 Sum[Binomial[n, 2k + 1]f[2k], {k, 0, Floor[(n - 1)/2]}], {n, 1, 30}]
|
|
CROSSREFS
|
Sequence in context: A099416 A101696 A136594 this_sequence A124721 A024023 A103453
Adjacent sequences: A097037 A097038 A097039 this_sequence A097041 A097042 A097043
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Mario Catalani (mario.catalani(AT)unito.it), Jul 22 2004
|
|
|
Search completed in 0.002 seconds
|
