|
| |
|
|
A026797
|
|
Number of partitions of n in which the least part is 4.
|
|
12
| |
|
|
0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 11, 12, 16, 18, 24, 27, 34, 39, 50, 57, 70, 81, 100, 115, 140, 161, 195, 225, 269, 311, 371, 427, 505, 583, 688, 791, 928, 1067, 1248, 1434, 1668, 1914, 2223, 2546, 2945, 3370, 3889
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,12
|
|
|
LINKS
| Jason Kimberley, Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g
|
|
|
FORMULA
| G.f.: x^4 * Product 1/(1-x^m); m=4..inf.
|
|
|
CROSSREFS
| Not necessarily connected 2-regular graphs with girth at least g [partitions into parts >= g]: A026807 (triangle); chosen g: A000041 (g=1 -- multigraphs with loops allowed), A002865 (g=2 -- multigraphs with loops forbidden), A008483 (g=3), A008484 (g=4), A185325(g=5), A185326 (g=6), A185327 (g=7), A185328 (g=8), A185329 (g=9).
Not necessarily connected 2-regular graphs with girth exactly g [partitions with smallest part g]: A026794 (triangle); chosen g: A002865 (g=2 -- multigraphs with at least one pair of parallel edges, but loops forbidden), A026796 (g=3), this sequence (g=4), A026798 (g=5), A026799 (g=6), A026800 (g=7), A026801 (g=8), A026802 (g=9), A026803 (g=10).
Sequence in context: A126793 A069910 A008484 * A027189 A140829 A184324
Adjacent sequences: A026794 A026795 A026796 * A026798 A026799 A026800
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
