Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Jun 28 2018 17:37:09
%S 1,2,4,11,31,116,466,2207,11258,63098,379448,2496922,18441849,
%T 163588975
%N Number of parity perfect graphs on n nodes.
%H S. Hougardy, <a href="http://www.or.uni-bonn.de/~hougardy/">Home Page</a>
%H S. Hougardy, <a href="http://dx.doi.org/10.1016/j.disc.2006.05.021">Classes of perfect graphs</a>, Discr. Math. 306 (2006), 2529-2571.
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 8c665c7.
%H Jessica Shi, <a href="https://pdfs.semanticscholar.org/c264/67cd4a5f0adee094d7c19fd8a08a78b46793.pdf">Enumeration of unlabeled graph classes: A study of tree decompositions and related approaches</a>, 2015.
%F Euler transform of A280763.
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Oct 18 2006
%E a(11)-a(14) added using tinygraph by _Falk Hüffner_, Jun 28 2018