|
Search: id:A108947
|
|
|
| A108947 |
|
Triangle: T(n,k) is the partition function G(n-k,k). |
|
+0
1
|
|
| 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 4, 2, 1, 1, 0, 1, 10, 5, 2, 1, 1, 0, 1, 26, 14, 5, 2, 1, 1, 0, 1, 76, 46, 15, 5, 2, 1, 1, 0, 1, 232, 166, 51, 15, 5, 2, 1, 1, 0, 1, 764, 652, 196, 52, 15, 5, 2, 1, 1, 0, 1, 2620, 2880, 827, 202, 52, 15, 5, 2, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,13
|
|
|
COMMENT
|
See entries for A001680 and A001681 for appropriate references.
|
|
FORMULA
|
E.g.f. for sequence G(0, k), G(1, k), ... is exp(x+1/2*x^2+...+1/k!*x^k).
|
|
CROSSREFS
|
Cf. A000110. First differences of a sequence G(k, 0), G(k, 1), ... give a row of A080510 (eg 0, 1, 10, 14, 15, 15, ... gives 1, 9, 4, 1).
Sequence in context: A077042 A144903 A108934 this_sequence A152459 A097608 A143439
Adjacent sequences: A108944 A108945 A108946 this_sequence A108948 A108949 A108950
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Paul Boddington (psb(AT)maths.warwick.ac.uk), Jul 21 2005
|
|
|
Search completed in 0.002 seconds
|
