|
Search: id:A089353
|
|
|
| A089353 |
|
Triangle read by rows: T(n,m) = number of planar partitions of n with trace m. |
|
+0
3
|
|
| 1, 2, 1, 3, 2, 1, 4, 6, 2, 1, 5, 10, 6, 2, 1, 6, 19, 14, 6, 2, 1, 7, 28, 28, 14, 6, 2, 1, 8, 44, 52, 33, 14, 6, 2, 1, 9, 60, 93, 64, 33, 14, 6, 2, 1, 10, 85, 152, 127, 70, 33, 14, 6, 2, 1, 11, 110, 242, 228, 142, 70, 33, 14, 6, 2, 1, 12, 146, 370, 404, 272, 149, 70, 33, 14, 6, 2, 1, 13
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Also number of partitions of n objects of 2 colors into k parts, each part containing at least one black object.
|
|
REFERENCES
|
G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976 (Ch. XI, exercise 5 and Ch. XII, exercise 5).
|
|
FORMULA
|
G.f.: Prod(k=1..oo, 1/(1-q x^k)^k).
|
|
EXAMPLE
|
1; 2,1; 3,2,1; 4,6,2,1; 5,10,6,2,1; 6,19,14,6,2,1; ...
|
|
CROSSREFS
|
Cf. A000219 (row sums), A005380, A005993 (trace 2), A050531 (trace 3), A089351 (trace 4).
Sequence in context: A029635 A104741 A167237 this_sequence A136451 A066121 A039911
Adjacent sequences: A089350 A089351 A089352 this_sequence A089354 A089355 A089356
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Wouter Meeussen and Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 26 2003
|
|
EXTENSIONS
|
Edited by Christian G. Bower (bowerc(AT)usa.net), Jan 08 2004
|
|
|
Search completed in 0.002 seconds
|
