|
| |
|
|
A112408
|
|
Number of connected simple graphs with n vertices, n+3 edges, and vertex degrees no more than 4.
|
|
7
|
|
|
|
0, 0, 0, 0, 2, 14, 79, 430, 2161, 10162, 45282, 192945, 790849, 3138808, 12116550, 45675153, 168661704
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,5
|
|
|
LINKS
|
Table of n, a(n) for n=1..17.
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.
|
|
|
PROG
|
(nauty/bash)
for n in {5..15}; do geng -c -D4 ${n} $((n+3)):$((n+3)) -u; done # Andrey Zabolotskiy, Nov 24 2017
|
|
|
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.
Sequence in context: A133224 A183577 A121200 * A026291 A220867 A216985
Adjacent sequences: A112405 A112406 A112407 * A112409 A112410 A112411
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Jonathan Vos Post, Dec 21 2005
|
|
|
EXTENSIONS
|
Corrected offset, new name, and a(18) from Andrey Zabolotskiy, Nov 24 2017
|
|
|
STATUS
|
approved
|
| |
|
|
