|
|
A130760
|
|
Noncrossing set partition version of A102356.
|
|
3
|
|
|
1, 1, 1, 3, 6, 10, 30, 105, 280, 756, 2520, 6930, 18480, 60060, 180180, 675675, 2162160, 6806800, 24504480, 77597520, 232792560, 888844320, 3259095840, 10708457760, 37479602160, 133855722000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, vol. 4, section 7.2.1.5, problem 65.
|
|
LINKS
|
|
|
EXAMPLE
|
a(7) = 105 because there are 105 noncrossing set partitions of {1,2,3,4,5,6,7} of type {3,2,1,1} and all other integer partitions of 7 produce fewer noncrossing set partitions.
|
|
MATHEMATICA
|
<<Combinatorica`
ncsp[p_] := FactorialPower[Total[p], Length[p] - 1]/Apply[Times, Map[Factorial[Count[p, #1]] &, Range[Max[p]]]]; a[n_] := Max[Map[ncsp, Partitions[n]]];
Table[a[n], {n, 0, 20}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|