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 A335447 #11 Jun 29 2020 22:21:07
%S A335447 0,0,0,0,0,1,0,0,0,1,0,2,0,1,1,0,0,2,0,2,1,1,0,3,0,1,0,2,0,5,0,0,1,1,
%T A335447 1,5,0,1,1,3,0,5,0,2,2,1,0,4,0,2,1,2,0,3,1,3,1,1,0,11,0,1,2,0,1,5,0,2,
%U A335447 1,5,0,9,0,1,2,2,1,5,0,4,0,1,0,11,1,1
%N A335447 Number of (1,2)-matching permutations of the prime indices of n.
%C A335447 Depends only on sorted prime signature (A118914).
%C A335447 Also the number of (2,1)-matching permutations of the prime indices of n.
%C A335447 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 A335447 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 A335447 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>
%H A335447 Gus Wiseman, <a href="/A102726/a102726.txt">Sequences counting and ranking compositions by the patterns they match or avoid.</a>
%F A335447 a(n) = A008480(n) - 1.
%e A335447 The a(n) permutations for n = 6, 12, 24, 48, 30, 72, 60:
%e A335447 (12) (112) (1112) (11112) (123) (11122) (1123)
%e A335447 (121) (1121) (11121) (132) (11212) (1132)
%e A335447 (1211) (11211) (213) (11221) (1213)
%e A335447 (12111) (231) (12112) (1231)
%e A335447 (312) (12121) (1312)
%e A335447 (12211) (1321)
%e A335447 (21112) (2113)
%e A335447 (21121) (2131)
%e A335447 (21211) (2311)
%e A335447 (3112)
%e A335447 (3121)
%t A335447 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A335447 Table[Length[Select[Permutations[primeMS[n]],!GreaterEqual@@#&]],{n,100}]
%Y A335447 The avoiding version is A000012.
%Y A335447 Patterns are counted by A000670.
%Y A335447 Positions of zeros are A000961.
%Y A335447 (1,2)-matching patterns are counted by A002051.
%Y A335447 Permutations of prime indices are counted by A008480.
%Y A335447 (1,2)-matching compositions are counted by A056823.
%Y A335447 STC-numbers of permutations of prime indices are A333221.
%Y A335447 Patterns matched by standard compositions are counted by A335454.
%Y A335447 (1,2,1) or (2,1,2)-matching permutations of prime indices are A335460.
%Y A335447 (1,2,1) and (2,1,2)-matching permutations of prime indices are A335462.
%Y A335447 Dimensions of downsets of standard compositions are A335465.
%Y A335447 (1,2)-matching compositions are ranked by A335485.
%Y A335447 Cf. A056239, A056986, A112798, A181796, A333175, A335451, A335452, A335463, A333175.
%K A335447 nonn
%O A335447 1,12
%A A335447 _Gus Wiseman_, Jun 14 2020