OFFSET
0,4
COMMENTS
Also the number of integer partitions of n such that for each part k the multiplicity of k is at most A000005(k).
EXAMPLE
The partition (4,2,2,1) has choices such as ((2,2),(1,1),(2),(1)) so is counted under a(9).
The a(1) = 1 through a(9) = 12 partitions:
(1) (2) (3) (4) (5) (6) (7) (8) (9)
(21) (22) (32) (33) (43) (44) (54)
(31) (41) (42) (52) (53) (63)
(221) (51) (61) (62) (72)
(321) (322) (71) (81)
(331) (332) (432)
(421) (422) (441)
(431) (522)
(521) (531)
(3221) (621)
(3321)
(4221)
MATHEMATICA
consptns[n_]:=Select[IntegerPartitions[n], SameQ@@#&];
Table[Length[Select[IntegerPartitions[n], Select[Tuples[consptns/@#], UnsameQ@@#&]!={}&]], {n, 0, 15}]
CROSSREFS
The complement for strict partitions is A387137.
For strict instead of constant partitions we have A387178.
These partitions are ranked by A387181.
A000005 counts constant integer partitions.
A000009 counts strict integer partitions.
A000041 counts integer partitions.
A063834 counts twice-partitions.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 07 2025
STATUS
approved
