[go: up one dir, main page]

login
A368037
Numbers k such that the number of strict partitions of k is the number of unrestricted partitions of some number.
2
1, 2, 3, 4, 7, 8
OFFSET
1,2
COMMENTS
Are there others? See A072246.
EXAMPLE
The 1 partition of 1 is [1]; the 1 strict partition of 1 is [1].
The 2 partitions of 2 are [2] and [1,1]; the 2 strict partitions of 3 are [3] and [2,1].'
The 3 partitions of 3 are [3], [2,1], [1,1,1]; the 3 strict partitions of 5 are [5], [4,1], [3,2].
The 5 partitions of 4 are [4], [3,1], [2,2], 2,1,1], [1,1,1,1]; the 5 restricted partitions of 7 are [7],[6,1], [5,2], [4,3], [4,2,1].
CROSSREFS
Sequence in context: A223488 A175686 A305563 * A373814 A351490 A054426
KEYWORD
nonn
AUTHOR
Clark Kimberling, Dec 23 2023
STATUS
approved