cp's OEIS Frontend

A335516 Number of normal patterns contiguously matched by the prime indices of n in increasing or decreasing order, counting multiplicity.

%I A335516 #10 Jun 27 2020 09:07:43
%S A335516 1,2,2,3,2,3,2,4,3,3,2,5,2,3,3,5,2,5,2,5,3,3,2,7,3,3,4,5,2,4,2,6,3,3,
%T A335516 3,7,2,3,3,7,2,4,2,5,5,3,2,9,3,5,3,5,2,7,3,7,3,3,2,7,2,3,5,7,3,4,2,5,
%U A335516 3,4,2,10,2,3,5,5,3,4,2,9,5,3,2,7,3,3,3
%N A335516 Number of normal patterns contiguously matched by the prime indices of n in increasing or decreasing order, counting multiplicity.
%C A335516 First differs from A181796 at a(180) = 9, A181796(180) = 10.
%C A335516 First differs from A335549 at a(90) = 7, A335549(90) = 8.
%C A335516 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 A335516 We define a (normal) pattern to be a finite sequence covering an initial interval of positive integers. Patterns are counted by A000670 and ranked by A333217. A sequence S is said to contiguously match a pattern P if there is a contiguous subsequence of S whose parts have the same relative order as P. For example, (3,1,1,3) contiguously matches (1,1,2) and (2,1,1) but not (2,1,2), (1,2,1), (1,2,2), or (2,2,1).
%H A335516 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>
%H A335516 Gus Wiseman, <a href="/A102726/a102726.txt">Sequences counting and ranking compositions by the patterns they match or avoid.</a>
%e A335516 The a(n) patterns for n = 2, 30, 12, 60, 120, 540, 1500:
%e A335516   ()   ()     ()     ()      ()       ()        ()
%e A335516   (1)  (1)    (1)    (1)     (1)      (1)       (1)
%e A335516        (12)   (11)   (11)    (11)     (11)      (11)
%e A335516        (123)  (12)   (12)    (12)     (12)      (12)
%e A335516               (112)  (112)   (111)    (111)     (111)
%e A335516                      (123)   (112)    (112)     (112)
%e A335516                      (1123)  (123)    (122)     (122)
%e A335516                              (1112)   (1112)    (123)
%e A335516                              (1123)   (1122)    (1123)
%e A335516                              (11123)  (1222)    (1222)
%e A335516                                       (11222)   (1233)
%e A335516                                       (12223)   (11233)
%e A335516                                       (112223)  (12333)
%e A335516                                                 (112333)
%t A335516 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A335516 mstype[q_]:=q/.Table[Union[q][[i]]->i,{i,Length[Union[q]]}];
%t A335516 Table[Length[Union[mstype/@ReplaceList[primeMS[n],{___,s___,___}:>{s}]]],{n,100}]
%Y A335516 The version for standard compositions is A335458.
%Y A335516 The not necessarily contiguous version is A335549.
%Y A335516 Patterns are counted by A000670 and ranked by A333217.
%Y A335516 A number's prime indices are given in the rows of A112798.
%Y A335516 Contiguous subsequences of standard compositions are A124771.
%Y A335516 Contiguous sub-partitions of prime indices are counted by A335519.
%Y A335516 Minimal avoided patterns of prime indices are counted by A335550.
%Y A335516 Patterns contiguously matched by partitions are counted by A335838.
%Y A335516 Cf. A000005, A056239, A056986, A108917, A124770, A181796, A269134, A333224, A334299, A335457, A335837.
%K A335516 nonn
%O A335516 1,2
%A A335516 _Gus Wiseman_, Jun 26 2020