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

0, 0, 0, 0, 2, 14, 79, 430, 2161, 10162, 45282, 192945, 790849, 3138808, 12116550, 45675153, 168661704, 611701138, 2183635232, 7686541342, 26720976964, 91856241351, 312594121721, 1054104924270

Offset: 1

Author

Jonathan Vos Post, Dec 21 2005

Keywords

• nonn

Links

• J. B. Hendrickson and C. A. Parks, Generation and Enumeration of Carbon skeletons, J. Chem. Inf. Comput. Sci., 31 (1991), 101-107. See Table 2, column 4 on page 103.
• Michael A. Kappler, GENSMI: Exhaustive Enumeration of Simple Graphs.

Crossrefs

The analogs for n+k edges with k = -1, 0, ..., 7 are: A000602, A036671, A112410, A112619, this sequence, A112424, A112425, A112426, A112442. Cf. A121941.

Programs

nauty

for n in {5..15}; do geng -c -D4 ${n} $((n+3)):$((n+3)) -u; done # Andrey Zabolotskiy, Nov 24 2017

Extensions

Corrected offset, new name, and a(18) from Andrey Zabolotskiy, Nov 24 2017

a(18)-a(24) added by Georg Grasegger, Jun 05 2023