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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A210717 Number of disconnected regular simple graphs on n vertices with girth exactly 7. 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 15, 18, 20, 24, 27, 32, 36, 42, 48, 56, 63, 73, 83, 96, 109, 125, 144, 162, 210, 209, 845, 270, 32541, 346, 1885800, 443, 101215159, 565, 5025321572 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,22

LINKS

Table of n, a(n) for n=0..62.

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

FORMULA

a(n) = A185217(n) - A185218(n).

CROSSREFS

Sequence in context: A025150 A026800 A185327 * A171962 A238208 A029028

Adjacent sequences:  A210714 A210715 A210716 * A210718 A210719 A210720

KEYWORD

nonn,more,hard

AUTHOR

Jason Kimberley, Dec 18 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 16 01:36 EST 2017. Contains 296063 sequences.