login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184971 Irregular triangle C(n,g) counting the connected 7-regular simple graphs on 2n vertices with girth at least g. 7
1, 5, 1547, 21609301, 1, 733351105934, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,2

COMMENTS

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

LINKS

Table of n, a(n) for n=4..10.

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

EXAMPLE

1;

5;

1547;

21609301, 1;

733351105934, 1;

?, 8;

?, 741;

?, 2887493;

CROSSREFS

Connected 7-regular simple graphs with girth at least g: this sequence (triangle); chosen g: A014377 (g=3), A181153 (g=4).

Connected 7-regular simple graphs with girth exactly g: A184970 (triangle); chosen g: A184973 (g=3), A184974 (g=4).

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), this sequence (k=7), A184981 (k=8).

Sequence in context: A145694 A184970 A184973 * A014377 A165628 A119747

Adjacent sequences:  A184968 A184969 A184970 * A184972 A184973 A184974

KEYWORD

nonn,hard,more,tabf

AUTHOR

Jason Kimberley, Jan 10 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 January 22 00:08 EST 2022. Contains 350481 sequences. (Running on oeis4.)