login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186717 Irregular triangle C(n,k): the number of connected k-regular graphs on n vertices having girth at least seven. 11
1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 3, 0, 0, 1, 0, 0, 0, 1, 21, 0, 0, 1, 0, 0, 0, 1, 546, 0, 0, 1, 0, 0, 0, 1, 30368 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,74

LINKS

Jason Kimberley, Table of i, a(i) for i = 1..126 (n = 1..39)

Jason Kimberley, Connected regular graphs with girth at least 7

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

EXAMPLE

1;

0, 1;

0, 0;

0, 0;

0, 0;

0, 0;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1;

0, 0, 1, 1;

0, 0, 1, 0;

0, 0, 1, 3;

0, 0, 1, 0;

0, 0, 1, 21;

0, 0, 1, 0;

0, 0, 1, 546;

0, 0, 1, 0;

0, 0, 1, 30368;

0, 0, 1, 0;

0, 0, 1, 1782840;

0, 0, 1, 0;

0, 0, 1, 95079083;

0, 0, 1, 0;

0, 0, 1, 4686063120;

0, 0, 1, 0;

CROSSREFS

Triangular arrays C(n,k) counting connected simple k-regular graphs on n vertices with girth at least g: A068934 (g=3), A186714 (g=4), A186715 (g=5), A186716 (g=6), this sequence (g=7), A186718 (g=8), A186719 (g=9).

Connected k-regular simple graphs with girth at least 7: A186727 (any k), this sequence (triangle); specific k: A185117 (k=2), A014375 (k=3).

Triangular arrays C(n,k) counting connected simple k-regular graphs on n vertices with girth exactly g: A186733 (g=3), A186734 (g=4).

Sequence in context: A192732 A092573 A307801 * A233286 A305802 A186038

Adjacent sequences:  A186714 A186715 A186716 * A186718 A186719 A186720

KEYWORD

nonn,hard,tabf

AUTHOR

Jason Kimberley, Nov 28 2011

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 December 11 07:37 EST 2019. Contains 329914 sequences. (Running on oeis4.)