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 A246446 #22 Feb 16 2025 08:33:23
%S A246446 0,2,3,8,26,108,661,6150,97585,2700050,135841840,12568984762,
%T A246446 2179513027405
%N A246446 Number of nonhamiltonian graphs with n nodes.
%H A246446 Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu, <a href="https://arxiv.org/abs/1812.05650">Graphs with few Hamiltonian Cycles</a>, arXiv:1812.05650 [math.CO], 2018.
%H A246446 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/NonhamiltonianGraph.html">Nonhamiltonian Graph</a>
%H A246446 Wikipedia, <a href="https://en.wikipedia.org/wiki/Hamiltonian_path">Hamiltonian path</a>
%F A246446 a(n) = A000088(n) - A003216(n).
%t A246446 A000088 = Cases[Import["https://oeis.org/A000088/b000088.txt", "Table"], {_, _}][[All, 2]];
%t A246446 A003216 = Cases[Import["https://oeis.org/A003216/b003216.txt", "Table"], {_, _}][[All, 2]];
%t A246446 a[n_] := A000088[[n + 1]] - A003216[[n]];
%t A246446 a /@ Range[13] (* _Jean-François Alcover_, Jan 02 2020 *)
%Y A246446 Cf. A000088 (number of simple graphs on n nodes).
%Y A246446 Cf. A003216 (number of Hamiltonian graphs on n nodes).
%Y A246446 Cf. A126149 (number of connected nonhamiltonian graphs on n nodes).
%Y A246446 The labeled case is A326207.
%Y A246446 The directed case is A326223 (with loops) or A326222 (without loops).
%Y A246446 Unlabeled simple graphs not containing a Hamiltonian path are A283420.
%Y A246446 Cf. A006125, A057864, A326205, A326206.
%K A246446 nonn,more
%O A246446 1,2
%A A246446 _Eric W. Weisstein_, Aug 26 2014
%E A246446 a(12) from formula by _Falk Hüffner_, Aug 13 2017
%E A246446 a(13) added by _Jan Goedgebeur_, May 07 2019