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

%I #11 Dec 02 2018 18:41:44

%S 1,1,2,6,21,111,847,11036,259022,11599009,991757695

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

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

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

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

%Y Cf. A076281, A076317, A084269, A126739.

%K nonn,more

%O 1,3

%A _Eric W. Weisstein_, Oct 06 2002

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