OFFSET
1,12
COMMENTS
Also the number of strict integer partitions of n - 1 not containing 1 whose product of parts is a multiple of n. These are strict integer factorizations of multiples of n summing to n - 1.
EXAMPLE
The a(6) = 1 through a(16) = 3 partitions:
(3,2,1) . . . (5,4,1) . (8,3,1) . (7,6,1) (9,5,1) (8,4,3,1)
(6,3,2,1) (7,4,2,1) (6,5,3,1) (8,5,2,1)
(5,4,3,2,1) (6,4,3,2,1)
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], MemberQ[#, 1]&&UnsameQ@@#&&Divisible[Times@@#, n]&]], {n, 30}]
CROSSREFS
Positions of 0 after 9 appear to be the prime numbers A000040.
Not requiring 1 gives A379733.
Partitions of this type are ranked by A379845.
The case of equality for non-strict partitions is A380218 shifted left.
A379666 counts partitions by sum and product.
Counting and ranking multisets by comparing sum and product:
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jan 22 2025
STATUS
approved
