|
|
A137736
|
|
Number of set partitions of [n*(n-1)/2].
|
|
1
|
|
|
1, 1, 1, 5, 203, 115975, 1382958545, 474869816156751, 6160539404599934652455, 3819714729894818339975525681317, 139258505266263669602347053993654079693415, 359334085968622831041960188598043661065388726959079837
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
Among n persons we have (n^2-n)/2 undirected relations. We can set partition these relations into (up to) A137736(n)=Bell((n^2-n)/2) sets.
The number of graphs on n labeled nodes is A006125(n)=sum(binomial((n^2-n)/2,k),k=0..(n^2-n)/2).
See also A066655 which equals A066655(n)=sum(P((n^2-n)/2,k),k=0..(n^2-n)/2) where P(n) is the number of integer partitions of n.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Bell(n*(n-1)/2) = A000110(n*(n-1)/2).
a(n) = Sum_{k=0..(n^2-n)/2} Stirling2((n^2-n)/2,k).
|
|
EXAMPLE
|
a(4) = Bell(6) = 203.
|
|
MAPLE
|
seq(combinat[bell](n*(n-1)/2), n=0..12);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|