A333146 Number of non-unimodal negated permutations of the multiset of prime indices of n.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0, 3, 0, 0, 0, 2, 0, 2, 0, 1, 1, 0, 0, 3, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 8, 0, 0, 1, 0, 0, 2, 0, 1, 0, 2, 0, 7, 0, 0, 0, 1, 0, 2, 0, 3, 0, 0, 0, 8, 0, 0, 0
Offset: 1
Keywords
Examples
The a(n) permutations for n = 12, 24, 36, 60, 72, 90, 96: (121) (1121) (1212) (1132) (11212) (1232) (111121) (1211) (1221) (1213) (11221) (1322) (111211) (2121) (1231) (12112) (2132) (112111) (1312) (12121) (2231) (121111) (1321) (12211) (2312) (2131) (21121) (2321) (2311) (21211) (3121)
Links
- Eric Weisstein's World of Mathematics, Unimodal Sequence
Crossrefs
Dominated by A008480.
The non-negated version is A332671.
A more interesting version is A332742.
The complement is counted by A333145.
Unimodal compositions are A001523.
Unimodal normal sequences are A007052.
Compositions whose negation is unimodal are A332578.
Partitions with unimodal negated run-lengths are A332638.
Numbers with non-unimodal negated unsorted prime signature are A332642.
Programs
-
Mathematica
primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]]; unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]]; Table[Length[Select[Permutations[primeMS[n]],!unimodQ[-#]&]],{n,30}]
Comments