%I #9 Nov 05 2016 12:55:39
%S 1,1,2,5,20,91,823
%N The number of nonisomorphic graphs on n vertices whose chromatic symmetric function in the p basis has a nonzero coefficient for each possible term.
%C All graphs with a Hamiltonian path are included in this count. The smallest n for which a graph with n vertices satisfies this property and does not have a Hamiltonian path is n=5.
%Y Cf. A277686.
%K nonn,more
%O 1,3
%A _Caleb Ji_, _Sam Heil_, Oct 26 2016
|