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 A091430 #20 Feb 16 2025 08:32:52 %S A091430 0,1,1,1,0,0,1,1,1,2,0,1,1,0,1,1,0,0,1,1,1,0,0,1,1,0,1,3,0,1,1,1,0,0, %T A091430 0,1,1,0,1,1,0,1,1,0,1,0,0,2,2,0,1,1,0,1,1,3,1,0,0,2,1,0,1,2,0,0,1,0, %U A091430 0,0,0,2,1,0,1,1,0,0,1,0,3,0,0,6,0,0,0,0,0,0,4,0,1,0,0,3,1,0,0,1,0,1,1,1,0,0,0,3,1,3,1,3,0,0,0,0,2,0,0,3,1,0,0,1,1,0,1,4,1,0,0,0,2,0,0,0,0,0,1,0,0,0,0,2,0,0,2,1,0,0,1 %N A091430 Number of Hamiltonian symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census). %C A091430 a(n) = A059282(n) for n <= 5000 except a(5) and a(14) which are one less. This corresponds to the fact that the Petersen and Coxeter graphs are non-Hamiltonian. [Comment updated by Marston Conder, May 08 2017. See comment in A059282 for further information. - _N. J. A. Sloane_, May 09 2017] %H A091430 Marston Conder, <a href="/A091430/b091430.txt">Table of n, a(n) for n = 1..5000</a> %H A091430 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SymmetricCubicGraph.html">Symmetric Cubic Graph</a> %Y A091430 Cf. A059282. %K A091430 nonn %O A091430 1,10 %A A091430 _Eric W. Weisstein_, Jan 06 2004 %E A091430 Corrected and extended by _N. J. A. Sloane_, May 09 2017, using Marston Conder's b-file