login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184981 Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth at least g. 9
1, 1, 6, 94, 10786, 3459386, 1470293676, 733351105935, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

9,3

COMMENTS

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

LINKS

Table of n, a(n) for n=9..17.

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

EXAMPLE

1;

1;

6;

94;

10786;

3459386;

1470293676;

733351105935, 1;

?, 0;

?, 1;

?, 0;

?, 13;

?, 1;

CROSSREFS

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

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

Triangular arrays C(n,g) counting connected simple k-regular graphs on n vertices with girth at least g: A185131 (k=3), A184941 (k=4), A184951 (k=5), A184961 (k=6), A184971 (k=7), this sequence (k=8), A184991 (k=9).

Sequence in context: A296820 A184983 A184980 * A014378 A180260 A058465

Adjacent sequences:  A184978 A184979 A184980 * A184982 A184983 A184984

KEYWORD

nonn,hard,more,tabf

AUTHOR

Jason Kimberley, Jan 19 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 25 22:37 EST 2021. Contains 341618 sequences. (Running on oeis4.)