A335407 Number of anti-run permutations of the prime indices of n!.
1, 1, 1, 2, 0, 2, 3, 54, 0, 30, 105, 6090, 1512, 133056, 816480, 127209600, 0, 10090080, 562161600, 69864795000, 49989139200, 29593652088000, 382147120555200, 41810689605484800, 4359985823793600, 3025062801079038720, 49052072750637116160, 25835971971637227375360
Offset: 0
Keywords
Examples
The a(0) = 1 through a(6) = 3 anti-run permutations: () () (1) (1,2) . (1,2,1,3,1) (1,2,1,2,1,3,1) (2,1) (1,3,1,2,1) (1,2,1,3,1,2,1) (1,3,1,2,1,2,1)
Links
- Andrew Howroyd, Table of n, a(n) for n = 0..200
Crossrefs
The version for Mersenne numbers is A335432.
Anti-run compositions are A003242.
Anti-run patterns are counted by A005649.
Permutations of prime indices are A008480.
Anti-runs are ranked by A333489.
Separable partitions are ranked by A335433.
Inseparable partitions are ranked by A335448.
Anti-run permutations of prime indices are A335452.
Strict permutations of prime indices are A335489.
Programs
-
Mathematica
primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]; Table[Length[Select[Permutations[primeMS[n!]],!MatchQ[#,{_,x_,x_,_}]&]],{n,0,10}]
-
PARI
\\ See A335452 for count. a(n)={count(factor(n!)[,2])} \\ Andrew Howroyd, Feb 03 2021
Formula
Extensions
Terms a(14) and beyond from Andrew Howroyd, Feb 03 2021
Comments