Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Jun 05 2023 08:32:06
%S 0,0,0,0,0,0,2,35,707,11477,146428,1530906,13663758,107554370,
%T 764873164,5004170844,30537798974,175688807383,960958921848,
%U 5030916734826
%N Number of connected simple graphs with n vertices, n+7 edges, and vertex degrees no more than 4.
%H 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 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 (nauty/bash)
%o for n in {7..13}; do geng -c -D4 ${n} $((n+7)):$((n+7)) -u; done # _Andrey Zabolotskiy_, Nov 24 2017
%Y The analogs for n+k edges with k = -1, 0, ..., 6 are: A000602, A036671, A112410, A112619, A112408, A112424, A112425, A112426. Cf. A121941.
%K nonn,more
%O 1,7
%A _Jonathan Vos Post_, Dec 21 2005
%E New name, offset corrected, a(11) corrected, and a(14) added by _Andrey Zabolotskiy_, Nov 24 2017
%E a(15)-a(20) added by _Georg Grasegger_, Jun 05 2023