|
|
A185336
|
|
Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth at least 6.
|
|
4
|
|
|
1, 0, 0, 0, 0, 0, 0, 1, 1, 5, 32, 385, 7574, 181227, 4624502, 122090545, 3328929960, 93990692632, 2754222605808
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,10
|
|
COMMENTS
|
The null graph on 0 vertices is vacuously 3-regular; since it is acyclic, it has infinite girth.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
A014374 = Cases[Import["https://oeis.org/A014374/b014374.txt", "Table"], {_, _}][[All, 2]];
etr[f_] := Module[{b}, b[n_] := b[n] = If[n == 0, 1, Sum[Sum[d f[d], {d, Divisors[j]}] b[n - j], {j, 1, n}]/n]; b];
|
|
CROSSREFS
|
3-regular simple graphs with girth at least 6: A014374 (connected), A185236 (disconnected), this sequence (not necessarily connected).
Not necessarily connected k-regular simple graphs with girth at least 6: A185326 (k=2), this sequence (k=3).
Not necessarily connected 3-regular simple graphs with girth *at least* g: A005638 (g=3), A185334 (g=4), A185335 (g=5), this sequence (g=6).
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|