|
Search: id:A091355
|
|
|
| A091355 |
|
Triangle read by rows: T(n,k) = number of planar partitions of n with at most k rows. |
|
+0
6
|
|
| 1, 2, 1, 3, 2, 1, 5, 5, 2, 1, 7, 9, 5, 2, 1, 11, 18, 11, 5, 2, 1, 15, 30, 22, 11, 5, 2, 1, 22, 53, 42, 24, 11, 5, 2, 1, 30, 85, 78, 46, 24, 11, 5, 2, 1, 42, 139, 138, 90, 48, 24, 11, 5, 2, 1, 56, 215, 239, 164, 94, 48, 24, 11, 5, 2, 1, 77, 336, 405, 298, 176, 96, 48, 24, 11, 5, 2, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
k-th column is EulerTransform[1, 2, 3, .., k, k, k, ..]-EulerTransform[1, 2, 3, .., k-1, k-1, k-1, ..] - Wouter Meeussen (wouter.meeussen(AT)pandora.be), Aug 29 2004
|
|
EXAMPLE
|
1; 2,1; 3,2,1; 5,5,2,1; 7,9,5,2,1; ...
|
|
MATHEMATICA
|
(* load EulerTransform from 'seqtranslib.m' under OEIS-Transforms *) Table[EulerTransform[Table[Min[c, r], {r, 20}]] - EulerTransform[Table[Min[c-1, r], {r, 20}]], {c, 20}] // Transpose
|
|
CROSSREFS
|
Row sums give A000219. Columns 1-5 are A000041, A091356-A091359.
Columns converge to A091360.
Sequence in context: A129262 A131243 A038497 this_sequence A131245 A104446 A131345
Adjacent sequences: A091352 A091353 A091354 this_sequence A091356 A091357 A091358
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net), Jan 02 2004
|
|
|
Search completed in 0.002 seconds
|
