A184980 Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth exactly g.

1, 1, 6, 94, 10786, 3459386, 1470293676, 733351105934, 1

Offset: 9

Author

Jason Kimberley, Jan 19 2012

Keywords

• nonn
• hard
• more
• tabf

Comments

The first column is for girth at least 3. The row length is incremented to g-2 when 2n reaches A054760(8,g).

Examples

			1;
1;
6;
94;
10786;
3459386;
1470293676;
733351105934, 1;
?, 0;
?, 1;
?, 0;
?, 13;
?, 1;
		

Links

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

Crossrefs

Connected 8-regular simple graphs with girth at least g: A184981 (triangle); chosen g: A014378 (g=3), A181154 (g=4).

Connected 8-regular simple graphs with girth exactly g: this sequence (triangle); chosen g: A184983 (g=3).

Triangular arrays C(n,g) counting connected simple k-regular graphs on n vertices with girth exactly g: A198303 (k=3), A184940 (k=4), A184950 (k=5), A184960 (k=6), A184970 (k=7), this sequence (k=8).