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!)
A185227 Number of disconnected 2-regular simple graphs on n vertices with girth at least 7. 12
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 9, 10, 12, 14, 17, 19, 23, 26, 31, 35, 41, 47, 55, 62, 72, 82, 95, 107, 124, 140, 161, 182, 208, 235, 269, 303, 345, 389, 442, 497, 564, 634, 718, 806, 910, 1021, 1152, 1290, 1452, 1627, 1828, 2044, 2294 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,17

COMMENTS

Number of partitions of n with each part at least 7, and at least 2 parts.

LINKS

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

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

PROG

(MAGMA) A185227 := func<n|n eq 0 select 0 else #RestrictedPartitions(n, {7..n-1})>;

CROSSREFS

Disconnected 2-regular simple graphs with girth at least g: A165652 (g=3), A185224 (g=4), A185225 (g=5), A185226 (g=6), this sequence (g=7), A185228 (g=8), A185229 (g=9).

Disconnected k-regular simple graphs with girth at least 7: A185217 (all k), A185207 (triangle); this sequence (k=2), A185237 (k=3).

Sequence in context: A114372 A046676 A003114 * A217569 A026823 A025148

Adjacent sequences:  A185224 A185225 A185226 * A185228 A185229 A185230

KEYWORD

nonn,easy

AUTHOR

Jason Kimberley, Feb 22 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 May 31 09:30 EDT 2020. Contains 334748 sequences. (Running on oeis4.)