|
Search: id:A000557
|
|
|
| A000557 |
|
From Fibonacci sums.
(Formerly M1881 N0743)
|
|
+0
4
|
|
| 1, 2, 8, 50, 416, 4322, 53888, 783890, 13031936, 243733442, 5064992768, 115780447730, 2887222009856, 77998677862562, 2269232452763648, 70734934220015570, 2351893466832306176, 83086463910558199682, 3107896091715557654528, 122711086194279627711410
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
G. Ledin, On a certain kind of Fibonacci sums, Fib. Quart., 5 (1967), 45-58.
|
|
FORMULA
|
E.g.f.: 1/(1-2*sinh(x)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 06 2002
a(n) = Sum[k=0..n, k!*Stirling2(n, k)*Fibonacci(k+2)].
|
|
CROSSREFS
|
Sequence in context: A034491 A121677 A120956 this_sequence A002801 A089104 A050398
Adjacent sequences: A000554 A000555 A000556 this_sequence A000558 A000559 A000560
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
