OFFSET
1,8
COMMENTS
The Look-and-Say partition of a multiset or partition y is obtained by interchanging parts with multiplicities. Hence, the multiplicity of k in the Look-and-Say partition of y is the sum of all parts that appear exactly k times. For example, starting with (3,2,2,1,1) we get (2,2,2,1,1,1), the multiset union of ((1,1,1),(2,2),(2)).
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798, sum A056239.
Also the number of ways to choose a set of disjoint strict integer partitions, one of each nonzero multiplicity in the prime factorization of n.
FORMULA
a(2^n) = A000009(n).
a(prime(n)) = 1.
EXAMPLE
The a(27) = 2 partitions with Look-and-Say partition (2,2,2) are: (3,3), (2,2,1,1).
The prime indices of 3456 are {1,1,1,1,1,1,1,2,2,2}, and the partitions with Look-and-Say partition (2,2,2,1,1,1,1,1,1,1) are:
(7,3,3)
(7,2,2,1,1)
(6,3,3,1)
(5,3,3,2)
(4,3,3,2,1)
(4,3,2,2,1,1)
so a(3456) = 6.
MATHEMATICA
stp[y_]:=Select[Tuples[Select[IntegerPartitions[#], UnsameQ@@#&]&/@y], UnsameQ@@Join@@#&];
Table[Length[stp[Last/@FactorInteger[n]]], {n, 100}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Gus Wiseman, Apr 05 2025
STATUS
approved
