OFFSET
0,1
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)).
EXAMPLE
The terms together with their prime indices begin:
6: {1,2}
1: {}
8: {1,1,1}
32: {1,1,1,1,1}
64: {1,1,1,1,1,1}
128: {1,1,1,1,1,1,1}
256: {1,1,1,1,1,1,1,1}
6144: {1,1,1,1,1,1,1,1,1,1,1,2}
512: {1,1,1,1,1,1,1,1,1}
27648: {1,1,1,1,1,1,1,1,1,1,2,2,2}
1024: {1,1,1,1,1,1,1,1,1,1}
73728: {1,1,1,1,1,1,1,1,1,1,1,1,1,2,2}
2048: {1,1,1,1,1,1,1,1,1,1,1}
147456: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2}
165888: {1,1,1,1,1,1,1,1,1,1,1,2,2,2,2}
4096: {1,1,1,1,1,1,1,1,1,1,1,1}
248832: {1,1,1,1,1,1,1,1,1,1,2,2,2,2,2}
MATHEMATICA
stp[y_]:=Select[Tuples[Select[IntegerPartitions[#], UnsameQ@@#&]&/@y], UnsameQ@@Join@@#&];
z=Table[Length[stp[Last/@FactorInteger[n]]], {n, 10000}];
mnrm[s_]:=If[Min@@s==1, mnrm[DeleteCases[s-1, 0]]+1, 0];
Table[Position[z, k][[1, 1]], {k, 0, mnrm[z+1]-1}]
CROSSREFS
Positions of first appearances in A382525.
Look-and-Say partitions are ranked by A351294.
Section-sum partitions are ranked by A381432.
A122111 represents conjugation in terms of Heinz numbers.
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Apr 11 2025
STATUS
approved
