OFFSET
1,3
COMMENTS
Number of partitions of the number of edges of the complete graph of order n, K_n.
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
FORMULA
a(n) = p(n*(n-1)/2) = A000041(n*(n-1)/2).
a(n) ~ exp(Pi*sqrt(n*(n-1)/3))/(2*sqrt(3)*n*(n - 1)). - Ilya Gutkovskiy, Jan 13 2017
a(n) ~ exp(Pi*(n - 1/2) / sqrt(3)) / (2*sqrt(3)*n^2). - Vaclav Kotesovec, May 17 2018
EXAMPLE
a(4) = p(6) = 11.
MATHEMATICA
Table[PartitionsP[n(n-1)/2], {n, 1, 30}]
PROG
(MuPAD) combinat::partitions::count(binomial(n+2, n)) $n=-1..40 // Zerinvary Lajos, Apr 16 2007
(PARI) a(n) = numbpart(n*(n-1)/2); \\ Michel Marcus, Dec 18 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Roberto E. Martinez II, Jan 10 2002
EXTENSIONS
More terms from Vladeta Jovovic, Jan 12 2002
Edited by Dean Hickerson, Jan 14 2002
STATUS
approved