|
Search: id:A119271
|
|
|
| A119271 |
|
Triangle: number of exactly (m-1)-dimensional partitions of n, for n >= 1, m >= 0. |
|
+0
3
|
|
| 1, 0, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 5, 6, 1, 0, 1, 9, 18, 10, 1, 0, 1, 13, 44, 49, 15, 1, 0, 1, 20, 97, 172, 110, 21, 1, 0, 1, 28, 195, 512, 550, 216, 28, 1, 0, 1, 40, 377, 1370, 2195, 1486, 385, 36, 1, 0, 1, 54, 694, 3396, 7603, 7886, 3514, 638, 45, 1, 0, 1, 75, 1251, 7968
(list; table; graph; listen)
|
|
|
OFFSET
|
1,9
|
|
|
COMMENT
|
The partition of 1 is considered to be dimension -1 by convention.
|
|
FORMULA
|
a(n,m) = A096806(n,m-1)-a(n,m-1). Binomial transform of n-th row lists the (m-1) dimensional partitions of n.
|
|
EXAMPLE
|
Table starts:
1,
0,1,
0,1,1,
0,1,3,1,
0,1,5,6,1,
|
|
CROSSREFS
|
Cf. A119270, A096806. Column 1 is A007042.
Sequence in context: A103495 A081719 A121314 this_sequence A125104 A098157 A059045
Adjacent sequences: A119268 A119269 A119270 this_sequence A119272 A119273 A119274
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Frank Adams-Watters (FrankTAW(AT)Netscape.net), May 11 2006
|
|
|
Search completed in 0.002 seconds
|
