|
Search: id:A000569
|
|
|
| A000569 |
|
Number of graphical partitions of 2n. |
|
+0
15
|
|
| 1, 2, 5, 9, 17, 31, 54, 90, 151, 244, 387, 607, 933, 1420, 2136, 3173, 4657, 6799, 9803, 14048, 19956, 28179, 39467, 54996, 76104, 104802, 143481, 195485, 264941, 357635, 480408, 642723, 856398, 1136715, 1503172, 1980785
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..585
T. M. Barnes and C. D. Savage, A recurrence for counting graphical partitions, Electronic J. Combinatorics, 2 (1995)
Axel Kohnert, Dominance Order and Graphical Partitions, Electronic J. Combinatorics, 11 (2004)
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences related to graphical partitions
|
|
MATHEMATICA
|
<< MathWorld`Graphs`
Table[Count[RealizeDegreeSequence /@ Partitions[n], _Graph], {n, 2, 20, 2}]
|
|
CROSSREFS
|
Cf. A004250, A004251, A029889.
Sequence in context: A133470 A129696 A082281 this_sequence A115851 A163734 A019135
Adjacent sequences: A000566 A000567 A000568 this_sequence A000570 A000571 A000572
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
