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 A112408 #16 Jun 02 2025 16:32:15
%S A112408 0,0,0,0,2,14,79,430,2161,10162,45282,192945,790849,3138808,12116550,
%T A112408 45675153,168661704,611701138,2183635232,7686541342,26720976964,
%U A112408 91856241351,312594121721,1054104924270
%N A112408 Number of connected simple graphs with n vertices, n+3 edges, and vertex degrees no more than 4.
%H A112408 J. B. Hendrickson and C. A. Parks, <a href="https://doi.org/10.1021/ci00001a018">Generation and Enumeration of Carbon skeletons</a>, J. Chem. Inf. Comput. Sci., 31 (1991), 101-107. See Table 2, column 4 on page 103.
%H A112408 Michael A. Kappler, <a href="http://www.daylight.com/meetings/emug04/Kappler/GenSmi.html">GENSMI: Exhaustive Enumeration of Simple Graphs</a>.
%o A112408 (nauty)
%o A112408 for n in {5..15}; do geng -c -D4 ${n} $((n+3)):$((n+3)) -u; done # _Andrey Zabolotskiy_, Nov 24 2017
%Y A112408 The analogs for n+k edges with k = -1, 0, ..., 7 are: A000602, A036671, A112410, A112619, this sequence, A112424, A112425, A112426, A112442. Cf. A121941.
%K A112408 nonn
%O A112408 1,5
%A A112408 _Jonathan Vos Post_, Dec 21 2005
%E A112408 Corrected offset, new name, and a(18) from _Andrey Zabolotskiy_, Nov 24 2017
%E A112408 a(18)-a(24) added by _Georg Grasegger_, Jun 05 2023