|
| |
|
|
A066655
|
|
Number of partitions of n(n-1)/2.
|
|
3
| |
|
|
1, 1, 3, 11, 42, 176, 792, 3718, 17977, 89134, 451276, 2323520, 12132164, 64112359, 342325709, 1844349560, 10015581680, 54770336324, 301384802048, 1667727404093, 9275102575355, 51820051838712, 290726957916112
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| Number of partitions of the number of edges of the complete graph of order n, K_n.
|
|
|
FORMULA
| a(n) = p(n(n-1)/2) = A000041(n(n-1)/2)
|
|
|
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 (zerinvarylajos(AT)yahoo.com), Apr 16 2007
|
|
|
CROSSREFS
| Cf. A000041, A000217, A007294.
Cf. A173519. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 20 2010]
Sequence in context: A151089 A200212 A149070 * A118166 A106876 A034477
Adjacent sequences: A066652 A066653 A066654 * A066656 A066657 A066658
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Roberto E. Martinez II (remartin(AT)fas.harvard.edu), Jan 10 2002
|
|
|
EXTENSIONS
| More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 12 2002
Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 14, 2002
|
| |
|
|
