login
Number of connected 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.
7

%I #11 Dec 02 2018 18:34:45

%S 1,1,2,6,21,112,853,11117,261080,11716570,1006700555

%N Number of connected 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/n-ColorableGraph.html">n-Colorable Graph</a>

%F Inverse Euler transform of A076321. - _Andrew Howroyd_, Dec 02 2018

%Y Cf. A005142, A076322, A076323, A076324, A076325, A076326, A076327.

%Y Cf. A205568, A076321, A084269.

%Y Cf. A001349. [_R. J. Mathar_, Sep 21 2008]

%K nonn,more

%O 1,3

%A _Eric W. Weisstein_, Oct 06 2002

%E a(10)-a(11) from _Andrew Howroyd_, Dec 02 2018