cp's OEIS Frontend

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.

A112442 Number of connected simple graphs with n vertices, n+7 edges, and vertex degrees no more than 4.

This page as a plain text file.
%I A112442 #20 Jun 02 2025 16:32:33
%S A112442 0,0,0,0,0,0,2,35,707,11477,146428,1530906,13663758,107554370,
%T A112442 764873164,5004170844,30537798974,175688807383,960958921848,
%U A112442 5030916734826
%N A112442 Number of connected simple graphs with n vertices, n+7 edges, and vertex degrees no more than 4.
%H A112442 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 8 on page 103.
%H A112442 Michael A. Kappler, <a href="http://www.daylight.com/meetings/emug04/Kappler/GenSmi.html">GENSMI: Exhaustive Enumeration of Simple Graphs</a> [gives different a(11)].
%o A112442 (nauty)
%o A112442 for n in {7..13}; do geng -c -D4 ${n} $((n+7)):$((n+7)) -u; done # _Andrey Zabolotskiy_, Nov 24 2017
%Y A112442 The analogs for n+k edges with k = -1, 0, ..., 6 are: A000602, A036671, A112410, A112619, A112408, A112424, A112425, A112426. Cf. A121941.
%K A112442 nonn,more
%O A112442 1,7
%A A112442 _Jonathan Vos Post_, Dec 21 2005
%E A112442 New name, offset corrected, a(11) corrected, and a(14) added by _Andrey Zabolotskiy_, Nov 24 2017
%E A112442 a(15)-a(20) added by _Georg Grasegger_, Jun 05 2023