|
Search: id:A080145
|
|
|
| A080145 |
|
a(n)=sum(sum(F(i)F(i+1),i=1,m),m=1,n), F(n)=Fibonacci numbers A000045. |
|
+0
2
|
|
| 0, 1, 4, 13, 37, 101, 269, 710, 1865, 4890, 12810, 33546, 87834, 229963, 602062, 1576231, 4126639, 10803695, 28284455, 74049680, 193864595, 507544116, 1328767764, 3478759188, 9107509812, 23843770261, 62423800984, 163427632705
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
a(n)=F(n+1)F(n+2)-floor((n+2)/2). a(n) is the 2-fold convolution of F(n)F(n+1) A001654 with the sequence 1,1,1,....
|
|
FORMULA
|
G.f.: x/((1-2x-2x^2+x^3)(1-x)^2)
|
|
MATHEMATICA
|
CoefficientList[Series[x/((1-2x-2x^2+x^3)(1-x)^2), {x, 0, 30}], x]
|
|
CROSSREFS
|
Adjacent sequences: A080142 A080143 A080144 this_sequence A080146 A080147 A080148
Sequence in context: A103082 A048474 A054761 this_sequence A097551 A095126 A077842
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Mario Catalani (mario.catalani(AT)unito.it), Jan 31 2003
|
|
|
Search completed in 0.002 seconds
|
