login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112425 Number of connected simple graphs with n vertices, n+5 edges, and vertex degrees no more than 4. 7
0, 0, 0, 0, 1, 3, 31, 298, 2616, 20346, 140605, 880737, 5082279, 27402524, 139571729 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

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

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

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

PROG

(nauty/bash)

for n in {5..13}; do geng -c -D4 ${n} $((n+5)):$((n+5)) -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, A112424, this sequence, A112426, A112442. Cf. A121941.

Sequence in context: A198964 A212730 A236957 * A144579 A348709 A220997

Adjacent sequences: A112422 A112423 A112424 * A112426 A112427 A112428

KEYWORD

nonn

AUTHOR

Jonathan Vos Post, Dec 21 2005

EXTENSIONS

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 1 14:40 EST 2023. Contains 359993 sequences. (Running on oeis4.)