|
|
A321254
|
|
Regular triangle where T(n,k) is the number of non-isomorphic connected multiset partitions of weight n with multiset density -1 <= k <= n-2.
|
|
8
|
|
|
1, 3, 0, 6, 0, 0, 16, 1, 0, 0, 37, 3, 0, 0, 0, 105, 18, 2, 0, 0, 0, 279, 68, 7, 0, 0, 0, 0, 817, 293, 46, 3, 0, 0, 0, 0, 2387, 1141, 228, 17, 1, 0, 0, 0, 0, 7269, 4511, 1189, 135, 9, 0, 0, 0, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The multiset density of a multiset partition is the sum of the numbers of distinct vertices in each part minus the number of parts minus the number of vertices.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1
3 0
6 0 0
16 1 0 0
37 3 0 0 0
105 18 2 0 0 0
279 68 7 0 0 0 0
817 293 46 3 0 0 0 0
2387 1141 228 17 1 0 0 0 0
7269 4511 1189 135 9 0 0 0 0 0
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|