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 A342971 #7 Aug 20 2021 18:05:40 %S A342971 1,2,29,233,2297,21192,195862 %N A342971 Non-1-tough simplicial polyhedra with n nodes. %C A342971 A graph is 1-tough if there is no set of k vertices whose deletion splits the graph into more than k components. %C A342971 If a graph is not 1-tough then it is not Hamiltonian. %F A342971 a(n) = A007030(n) - A007031(n). %Y A342971 Cf. A000109, A115340, A007030, A007031. %K A342971 nonn,hard,more %O A342971 11,2 %A A342971 _William P. Orrick_, Apr 01 2021