OFFSET
1,6
COMMENTS
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.
A run in a sequence is a constant consecutive subsequence. The run-sums of a sequence are obtained by splitting it into maximal runs and taking their sums. See A353932 for run-sums of standard compositions.
EXAMPLE
For n = 12, none of the permutations (1,1,2), (1,2,1), (2,1,1) has distinct run-sums, so a(12) = 0.
The prime indices of 36 are {1,1,2,2}, and we have permutations: (1,1,2,2), (2,2,1,1), so a(36) = 2.
For n = 90 we have:
(1,2,2,3)
(1,3,2,2)
(2,2,1,3)
(2,2,3,1)
(3,1,2,2)
(3,2,2,1)
So a(90) = 6. The 6 missing permutations are: (1,2,3,2), (2,1,2,3), (2,1,3,2), (2,3,1,2), (2,3,2,1), (3,2,1,2).
MATHEMATICA
Table[Length[Select[Permutations[PrimePi /@ Join@@ConstantArray@@@FactorInteger[n]], UnsameQ@@Total/@Split[#]&]], {n, 100}]
CROSSREFS
Positions of 1 are A000961.
For equal instead of distinct run-sums we have A382877.
A044813 lists numbers whose binary expansion has distinct run-lengths.
A353932 lists run-sums of standard compositions.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Apr 12 2025
STATUS
approved
