|
|
A133611
|
|
A triangular array of numbers related to factorization and number of parts in Murasaki diagrams.
|
|
3
|
|
|
1, 1, 1, 2, 2, 1, 5, 5, 4, 1, 15, 15, 14, 7, 1, 52, 52, 51, 36, 11, 1, 203, 203, 202, 171, 81, 16, 1, 877, 877, 876, 813, 512, 162, 22, 1, 4140, 4140, 4139, 4012, 3046, 1345, 295, 29, 1, 21147, 21147, 21146, 20891, 17866, 10096, 3145, 499, 37, 1, 115975, 115975, 115974, 115463, 106133, 72028, 29503, 6676, 796, 46, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
When the Bell multisets are encoded as described in A130274, the seven case in the example can be coded as 19578, 15942, 30873, 26427, 35642, 29491 and 32938.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The array begins:
1
1 1
2 2 1
5 5 4 1
15 15 14 7 1
52 52 51 36 11 1
...
a(14) = 7 because only seven of the 52 Bell multisets can be generated by attaching a new stroke to the third element in the set of diaqrams with four strokes.
|
|
MAPLE
|
T:= proc(i, j) add(combinat:-stirling2(i, k), k=j..i) end proc:
# second Maple program:
b:= proc(n, t) option remember; `if`(n>0, add(b(n-j, t+1)*
binomial(n-1, j-1), j=1..n), add(x^j, j=0..t))
end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n, 0)):
|
|
MATHEMATICA
|
row[n_] := Table[StirlingS2[n, k], {k, 0, n}] // Reverse // Accumulate // Reverse;
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|