This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A277686 #9 Nov 05 2016 12:55:39 %S A277686 1,1,2,5,20,91,823 %N A277686 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 A277686 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 A277686 Cf. A277686. %K A277686 nonn,more %O A277686 1,3 %A A277686 _Caleb Ji_, _Sam Heil_, Oct 26 2016