A185264 -id:A185264 - cp's OEIS frontend

A185364 Not necessarily connected 6-regular simple graphs on n vertices with girth at least 4.

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 9, 6, 267, 3727, 483012, 69823723, 14836130862

Offset: 0

Jason Kimberley, Dec 07 2011

First differs from A058276 at n=24.

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

6-regular simple graphs with girth at least 4: A058276 (connected), A185264 (disconnected), this sequence (not necessarily connected).
Not necessarily connected k-regular simple graphs with girth at least 4: A185314 (any k), A185304 (triangle); specified degree k: A008484 (k=2), A185334 (k=3), A185344 (k=4), A185354 (k=5), this sequence (k=6).
Cf. A184964.

A058276 = Cases[Import["https://oeis.org/A058276/b058276.txt", "Table"], {, }][[All, 2]];
(* EulerTransform is defined in A005195 *)
EulerTransform[Rest @ A058276] (* Jean-François Alcover, Dec 04 2019, updated Mar 18 2020 *)

This sequence is the Euler transformation of A058276.

a(n) = A058276(n) + A185264(n).

A185063 Number of disconnected 6-regular simple graphs on n vertices with girth exactly 3.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 5, 25, 297, 8199, 377004, 22014143, 1493574756, 114880777582, 9919463450854

Offset: 0

Jason Kimberley, Mar 10 2012

Jason Kimberley, Index of sequences counting disconnected k-regular simple graphs with girth exactly g

Disconnected k-regular simple graphs with girth exactly 3: A210713 (any k), A210703 (triangle); for fixed k: A185033 (k=3), A185043 (k=4), A185053 (k=5), this sequence (k=6).

a(n) = A165656(n) - A185264(n).

cp's OEIS Frontend

A185364 Not necessarily connected 6-regular simple graphs on n vertices with girth at least 4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula