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

0, 0, 0, 0, 1, 8, 59, 427, 2768, 16461, 90111, 460699, 2222549, 10216607, 45076266, 192059940, 794088479, 3198709835, 12593964702, 48596474890, 184195614359, 687087962550, 2526421534903

Offset

1,6

Links

Table of n, a(n) for n=1..23.

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 5 on page 103.

Michael A. Kappler, GENSMI: Exhaustive Enumeration of Simple Graphs.

Prog

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

Crossrefs

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

Sequence in context: A002538 A263503 A343089 * A190977 A254662 A186362

Adjacent sequences: A112421 A112422 A112423 * A112425 A112426 A112427

Keyword

nonn

Author

Jonathan Vos Post, Dec 21 2005

Extensions

Corrected offset and new name from Andrey Zabolotskiy, Nov 24 2017

a(16)-a(23) added by Georg Grasegger, Jun 05 2023

Status

approved