|
| |
|
|
A026796
|
|
Number of partitions of n in which the least part is 3.
|
|
17
| |
|
|
0, 0, 1, 0, 0, 1, 1, 1, 2, 2, 3, 4, 5, 6, 9, 10, 13, 17, 21, 25, 33, 39, 49, 60, 73, 88, 110, 130, 158, 191, 230, 273, 331, 391, 468, 556, 660, 779, 927, 1087, 1284, 1510, 1775, 2075, 2438, 2842, 3323, 3872, 4510, 5237, 6095, 7056
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,9
|
|
|
LINKS
| Jason Kimberley, Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g
|
|
|
FORMULA
| G.f.: x^3 * Product 1/(1-x^m); m=3..inf.
|
|
|
CROSSREFS
| Essentially the same sequence as A008483.
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), this sequence (g=3), A026797 (g=4), A026798 (g=5), A026799 (g=6), A026800 (g=7), A026801 (g=8), A026802 (g=9), A026803 (g=10).
Sequence in context: A132326 A027195 A008483 * A008925 A036072 A045475
Adjacent sequences: A026793 A026794 A026795 * A026797 A026798 A026799
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
