|
Search: id:A094584
|
|
|
| A094584 |
|
Dot product of (1,2,...,n) and first n distinct Fibonacci numbers. |
|
+0
5
|
|
| 1, 5, 14, 34, 74, 152, 299, 571, 1066, 1956, 3540, 6336, 11237, 19777, 34582, 60134, 104062, 179320, 307855, 526775, 898706, 1529160, 2595624, 4396224, 7431049, 12537917, 21118814, 35517226, 59646386, 100034456, 167562035, 280348531
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 14.
|
|
FORMULA
|
a(n) = F(2)+2F(3)+3F(4)+...+nF(n+1)
(n+1)F(n+3) - F(n+5) + 3.
|
|
EXAMPLE
|
a(4)=(1,2,3,4)*(1,2,3,5)=1+4+9+20=34.
|
|
CROSSREFS
|
Cf. A000045, A094585.
Partial sums of A023607.
Sequence in context: A094002 A105082 A059821 this_sequence A023515 A047860 A083332
Adjacent sequences: A094581 A094582 A094583 this_sequence A094585 A094586 A094587
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), May 13 2004
|
|
|
Search completed in 0.002 seconds
|
