login
A382774
Number of ways to permute the prime indices of n! so that the run-lengths are all different.
4
1, 1, 1, 0, 2, 0, 6, 0, 0, 0, 96, 0
OFFSET
0,5
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.
FORMULA
a(n) = A382771(n!).
EXAMPLE
The prime indices of 24 are {1,1,1,2}, with permutations (1,1,1,2) and (2,1,1,1), so a(4) = 2.
MATHEMATICA
Table[Length[Select[Permutations[prix[n!]], UnsameQ@@Length/@Split[#]&]], {n, 0, 6}]
CROSSREFS
For anti-run permutations we have A335407, see also A335125, A382858.
This is the restriction of A382771 to the factorials A000142, equal A382857.
A022559 counts prime indices of n!, sum A081401.
A044813 lists numbers whose binary expansion has distinct run-lengths, equal A140690.
A056239 adds up prime indices, row sums of A112798.
A098859 counts partitions with distinct multiplicities, ordered A242882.
A239455 counts Look-and-Say partitions, ranks A351294, conjugate A381432.
A328592 lists numbers whose binary form has distinct runs of ones, equal A164707.
A329738 counts compositions with equal run-lengths, ranks A353744.
A329739 counts compositions with distinct run-lengths, ranks A351596.
A351293 counts non-Look-and-Say partitions, ranks A351295, conjugate A381433.
Sequence in context: A153059 A151336 A346092 * A180491 A329893 A047918
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Apr 09 2025
STATUS
approved