A125064 Number of simple graphs on at most 16 unlabeled vertices with maximal degree at most 4 with a single cycle of length 16-n.

1, 2, 11, 39, 169, 534, 1612, 3894, 8771, 16307, 29391, 43291, 69429, 83571

Offset

0,2

Comments

In the terms of the paper by Hendrickson and Parks, a(n) is the number of monocyclic skeletons with up to 16 nodes with a ring of size 16-n.

Links

Table of n, a(n) for n=0..13.

James B. Hendrickson and Camden A. Parks, Generation and Enumeration of Carbon Skeletons, J. Chem. Inf. Comput. Sci., 31 (1991), pp. 101-107. See Table VI on page 103.

Formula

Sum_n a(n) = Sum_{k=3..16} A036671(k).

Crossrefs

Cf. A000602, A036671, A112410, A112619, A112408, A112424, A112425, A112426.

Sequence in context: A276659 A187259 A296593 * A361493 A274326 A055329

Adjacent sequences: A125061 A125062 A125063 * A125065 A125066 A125067

Keyword

nonn,fini,full

Author

Parthasarathy Nambi, Jan 05 2007

Extensions

Edited by Andrey Zabolotskiy, Feb 02 2025

Status

approved