|
| |
|
|
A103436
|
|
Sum[i>=1, i^n*Fibonacci(i)/2^i ].
|
|
1
| |
|
|
2, 10, 94, 1330, 25102, 592210, 16765774, 553755730, 20902816462, 887654387410, 41883261304654, 2173850952162130, 123085699242396622, 7550010173496390610, 498737656015015238734, 35298805253912253800530
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| A103436[k] == (PolyLog[-k, (1 + Sqrt[5])/4] - PolyLog[-k, (1 - Sqrt[5])/4])/Sqrt[5]. -- Vladimir Reshetnikov (v.reshetnikov(AT)gmail.com), Jan 20, 2011.
|
|
|
REFERENCES
| A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 141.
|
|
|
CROSSREFS
| Sequence in context: A205320 A026025 A100622 * A160940 A193290 A193435
Adjacent sequences: A103433 A103434 A103435 * A103437 A103438 A103439
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Ralf Stephan, Feb 08 2005
|
| |
|
|
