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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185229 Number of disconnected 2-regular simple graphs on n vertices with girth at least 9. 9
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 15, 17, 19, 23, 25, 29, 33, 38, 42, 49, 54, 62, 70, 79, 88, 101, 112, 127, 142, 160, 178, 202, 224, 252, 281, 315, 350, 394, 436, 488, 543, 606, 672, 751, 831, 926, 1027, 1142 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,21 COMMENTS Number of partitions of n with each part at least 9, and at least 2 parts. LINKS Andrew Howroyd, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A185329() - A185119(n). - Andrew Howroyd, Apr 18 2021 PROG (MAGMA) A185229 := func; CROSSREFS Disconnected 2-regular simple graphs with girth at least g: A165652 (g=3), A185224 (g=4), A185225 (g=5), A185226 (g=6), A185227 (g=7), A185228 (g=8), this sequence (g=9). Cf. A185119, A185329. Sequence in context: A029029 A025157 A006141 * A026825 A025150 A026800 Adjacent sequences:  A185226 A185227 A185228 * A185230 A185231 A185232 KEYWORD nonn,easy AUTHOR Jason Kimberley, Feb 22 2011 EXTENSIONS Terms a(50) and beyond from Andrew Howroyd, Apr 18 2021 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.

Last modified August 2 08:25 EDT 2021. Contains 346422 sequences. (Running on oeis4.)