A185319 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 9.

1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 8, 8, 10, 10, 13, 13, 16, 17, 20, 21, 26, 27, 32, 35, 41, 44, 52, 56, 65, 72, 82, 90, 104, 114, 130, 144, 163, 180, 205, 226, 255, 283, 336

Offset

0,3

Links

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

Jason Kimberley, Index of sequences counting not necessarily connected k-regular simple graphs with girth at least g

Formula

a(n) = A186729(n) + A185219(n).

Crossrefs

Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), A185314 (g=4), A185315 (g=5), A185316 (g=6), A185317 (g=7), A185318 (g=8), this sequence (g=9).

Sequence in context: A025824 A230037 A211262 * A161232 A161056 A161260

Adjacent sequences: A185316 A185317 A185318 * A185320 A185321 A185322

Keyword

nonn,more,hard

Author

Jason Kimberley, Dec 19 2012

Status

approved