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 A366315 #39 Dec 21 2023 11:58:38
%S A366315 0,0,0,0,0,0,1,3,26,340,7297,233608
%N A366315 Number of Harris graphs with n vertices. Harris graphs are 1-tough, Eulerian graphs that are non-Hamiltonian.
%C A366315 There are no Harris graphs with 6 or fewer vertices.
%H A366315 Francesca Gandini, Shubhra Mishra, and Douglas Shaw, <a href="https://arxiv.org/abs/2312.10936">Families of Harris Graphs</a>, arXiv:2312.10936 [math.CO], 2023.
%H A366315 Shubhra Mishra, <a href="/A366315/a366315.png">Illustration for a(7) = 1: the unique minimal Harris graph of order 7</a>
%H A366315 Shubhra Mishra, <a href="/A366315/a366315_1.png">Illustration for a(8) = 3: the three order 8 Harris graphs</a>
%H A366315 Douglas J. Shaw, <a href="https://www.jstor.org/stable/48661740">Harris Graphs--A Graph Theory Activity for Students and Their Instructors</a>, The College Mathematics Journal, 49 (2018), 5, 323-326.
%e A366315 a(7)=1 because the only Harris graph of 7 vertices (0..6) has edges {(0,1), (0,2), (0,3), (0,4), (1,2), (1,3), (1,5), (2,3), (2,6), (3,4), (3,5), (3,6)}. - _Sean A. Irvine_, Oct 18 2023
%Y A366315 Cf. A007031.
%K A366315 nonn,more,hard
%O A366315 1,8
%A A366315 _Shubhra Mishra_, Oct 06 2023
%E A366315 a(11)-a(12) from _Sean A. Irvine_, Oct 18 2023