

A184980


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


8




OFFSET

9,3


COMMENTS

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


LINKS

Table of n, a(n) for n=9..17.
Jason Kimberley, Index of sequences counting connected kregular simple graphs with girth exactly g


EXAMPLE

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


CROSSREFS

Connected 8regular simple graphs with girth at least g: A184981 (triangle); chosen g: A014378 (g=3), A181154 (g=4).
Connected 8regular simple graphs with girth exactly g: this sequence (triangle); chosen g: A184983 (g=3).
Triangular arrays C(n,g) counting connected simple kregular 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).
Sequence in context: A198257 A296820 A184983 * A184981 A014378 A180260
Adjacent sequences: A184977 A184978 A184979 * A184981 A184982 A184983


KEYWORD

nonn,hard,more,tabf


AUTHOR

Jason Kimberley, Jan 19 2012


STATUS

approved



