|
Search: id:A024429
|
|
|
| A024429 |
|
Let A(0) = 1, B(0) = 0; A(n+1) = Sum_{k=0..n} binomial(n,k)*B(k), B(n+1) = Sum_{k=0..n} binomial(n,k)*A(k); entry gives B sequence (cf. A024430). |
|
+0
9
|
|
| 0, 1, 1, 2, 7, 27, 106, 443, 2045, 10440, 57781, 340375, 2115664, 13847485, 95394573, 690495874, 5235101739, 41428115543, 341177640610, 2917641580783, 25866987547865, 237421321934176, 2252995117706961, 22073206655954547
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 226, 4th line of table.
A. Fekete and others, Problem 10791, Amer. Math. Monthly, 108 (No. 2, 2001), 177-178.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
FORMULA
|
S(n,1) + S(n,3) + ... + S(n,2k+1), where k = [ (n-1)/2 ] and S(i,j) are Stirling numbers of second kind.
E.g.f.: sinh(exp(x)-1) - njas, Jan 28, 2001
|
|
CROSSREFS
|
Cf. A024430, A121867, A121868.
Sequence in context: A005519 A037381 A129013 this_sequence A136412 A026726 A026759
Adjacent sequences: A024426 A024427 A024428 this_sequence A024430 A024431 A024432
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
EXTENSIONS
|
Description changed by njas, Sep 05 2006
|
|
|
Search completed in 0.002 seconds
|
