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 A057864 #24 Feb 16 2025 08:32:43 %S A057864 1,1,2,5,18,91,734,10030,248427,11482572,1000231510 %N A057864 Number of simple traceable graphs on n nodes. %C A057864 Number of undirected graphs on n nodes possessing a Hamiltonian path (not circuit). %H A057864 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version f0eaa32. %H A057864 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TraceableGraph.html">Traceable Graph</a> %H A057864 Wikipedia, <a href="https://en.wikipedia.org/wiki/Hamiltonian_path">Hamiltonian path</a> %H A057864 Gus Wiseman, <a href="http://arxiv.org/abs/0709.0430">Enumeration of paths and cycles and e-coefficients of incomparability graphs</a>, arXiv:0709.0430 [math.CO], 2007. %H A057864 Gus Wiseman, <a href="/A057864/a057864.png">Non-isomorphic representatives of the a(5) = 18 unlabeled simple graphs containing a Hamiltonian path</a>. %F A057864 A000088(n) = a(n) + A283420(n). - _Gus Wiseman_, Jun 17 2019 %Y A057864 Main diagonal of A309524. %Y A057864 The labeled case is A326206. %Y A057864 The directed case is A326221 (with loops). %Y A057864 Unlabeled simple graphs not containing a Hamiltonian path are A283420. %Y A057864 Unlabeled simple graphs containing a Hamiltonian cycle are A003216. %Y A057864 Cf. A000088, A006125, A246446, A283420, A326205, A326217. %K A057864 nonn,more %O A057864 1,3 %A A057864 _Eric W. Weisstein_ %E A057864 a(8) and a(9) from _Eric W. Weisstein_, Jun 04 2004 %E A057864 a(10) from _Eric W. Weisstein_, May 27 2009 %E A057864 a(11) added using tinygraph by _Falk Hüffner_, Jan 19 2016