login

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”).

Number of chromatic symmetric functions realizable by exactly 2 graphs on n vertices.
1

%I #17 Oct 27 2016 07:49:13

%S 0,0,0,0,1,10,81,907,16111

%N Number of chromatic symmetric functions realizable by exactly 2 graphs on n vertices.

%Y Cf. A277203, A277204.

%K nonn,more

%O 1,6

%A _Sam Heil_ and _Caleb Ji_, Oct 04 2016