%I A000569
%S A000569 1,2,5,9,17,31,54,90,151,244,387,607,933,1420,2136,3173,4657,
%T A000569 6799,9803,14048,19956,28179,39467,54996,76104,104802,143481,195485,
%U A000569 264941,357635,480408,642723,856398,1136715,1503172,1980785
%N A000569 Number of graphical partitions of 2n.
%H A000569 T. D. Noe, <a href="b000569.txt">Table of n, a(n) for n = 1..585</a>
%H A000569 T. M. Barnes and C. D. Savage, A recurrence for counting graphical partitions, 
               <a href="http://www.combinatorics.org/">Electronic J. Combinatorics</
               a>, 2 (1995)
%H A000569 Axel Kohnert, Dominance Order and Graphical Partitions, <a href="http:/
               /www.combinatorics.org/">Electronic J. Combinatorics</a>, 11 (2004)
%H A000569 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               GraphicalPartition.html">Link to a section of The World of Mathematics.</
               a>
%H A000569 <a href="Sindx_Gra.html#graph_part">Index entries for sequences related 
               to graphical partitions</a>
%t A000569 << MathWorld`Graphs`
%t A000569 Table[Count[RealizeDegreeSequence /@ Partitions[n], _Graph], {n, 2, 20, 
               2}]
%Y A000569 Cf. A004250, A004251, A029889.
%Y A000569 Sequence in context: A133470 A129696 A082281 this_sequence A115851 A163734 
               A019135
%Y A000569 Adjacent sequences: A000566 A000567 A000568 this_sequence A000570 A000571 
               A000572
%K A000569 nonn
%O A000569 1,2
%A A000569 N. J. A. Sloane (njas(AT)research.att.com).