This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A335446 #16 Jun 29 2020 22:20:46
%S A335446 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,0,0,0,0,0,
%T A335446 0,3,0,0,0,2,0,0,0,1,1,0,0,3,0,0,0,1,0,0,0,2,0,0,0,6,0,0,1,0,0,0,0,1,
%U A335446 0,0,0,7,0,0,0,1,0,0,0,3,0,0,0,6,0,0,0
%N A335446 Number of (1,2,1)-matching permutations of the prime indices of n.
%C A335446 Depends only on unsorted prime signature (A124010), but not only on sorted prime signature (A118914).
%C A335446 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.
%C A335446 We define a pattern to be a finite sequence covering an initial interval of positive integers. Patterns are counted by A000670. A sequence S is said to match a pattern P if there is a not necessarily contiguous subsequence of S whose parts have the same relative order as P. For example, (3,1,1,3) matches (1,1,2), (2,1,1), and (2,1,2), but avoids (1,2,1), (1,2,2), and (2,2,1).
%H A335446 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>
%H A335446 Gus Wiseman, <a href="/A102726/a102726.txt">Sequences counting and ranking compositions by the patterns they match or avoid.</a>
%e A335446 The a(n) permutations for n = 12, 24, 36, 60, 72, 90, 120, 144:
%e A335446 (121) (1121) (1212) (1213) (11212) (1232) (11213) (111212)
%e A335446 (1211) (1221) (1231) (11221) (2132) (11231) (111221)
%e A335446 (2121) (1312) (12112) (2312) (11312) (112112)
%e A335446 (1321) (12121) (2321) (11321) (112121)
%e A335446 (2131) (12211) (12113) (112211)
%e A335446 (3121) (21121) (12131) (121112)
%e A335446 (21211) (12311) (121121)
%e A335446 (13112) (121211)
%e A335446 (13121) (122111)
%e A335446 (13211) (211121)
%e A335446 (21131) (211211)
%e A335446 (21311) (212111)
%e A335446 (31121)
%e A335446 (31211)
%t A335446 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A335446 Table[Length[Select[Permutations[primeMS[n]],MatchQ[#,{___,x_,___,y_,___,x_,___}/;x<y]&]],{n,100}]
%Y A335446 Positions of zeros are A065200.
%Y A335446 The avoiding version is A335449.
%Y A335446 Patterns are counted by A000670.
%Y A335446 Permutations of prime indices are counted by A008480.
%Y A335446 Unimodal permutations of prime indices are counted by A332288.
%Y A335446 (1,2,1) and (2,1,2)-avoiding permutations of prime indices are A333175.
%Y A335446 STC-numbers of permutations of prime indices are A333221.
%Y A335446 Patterns matched by standard compositions are counted by A335454.
%Y A335446 (1,2,1) or (2,1,2)-matching permutations of prime indices are A335460.
%Y A335446 (1,2,1) and (2,1,2)-matching permutations of prime indices are A335462.
%Y A335446 Dimensions of downsets of standard compositions are A335465.
%Y A335446 (1,2,1)-matching compositions are ranked by A335466.
%Y A335446 (1,2,1)-matching compositions are counted by A335470.
%Y A335446 (1,2,1)-matching patterns are counted by A335509.
%Y A335446 Cf. A056239, A056986, A112798, A158005, A158009, A181796, A335452, A335463.
%K A335446 nonn
%O A335446 1,24
%A A335446 _Gus Wiseman_, Jun 13 2020