login
Number of minimal normal patterns avoided by the prime indices of n in increasing or decreasing order, counting multiplicity.
6

%I #8 Jun 27 2020 09:07:56

%S 1,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,4,3,4,3,3,3,4,3,3,3,4,3,3,3,3,3,3,

%T 3,3,3,3,3,4,3,3,3,4,4,3,3,4,3,4,3,4,3,4,3,4,3,3,3,4,3,3,4,3,3,3,3,4,

%U 3,3

%N Number of minimal normal patterns avoided by the prime indices of n in increasing or decreasing order, counting multiplicity.

%C 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 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 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 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>

%H Gus Wiseman, <a href="/A102726/a102726.txt">Sequences counting and ranking compositions by the patterns they match or avoid.</a>

%F It appears that for n > 1, a(n) = 3 if n is a power of a squarefree number (A072774), and a(n) = 4 otherwise.

%e The a(12) = 4 minimal patterns avoiding (1,1,2) are: (2,1), (1,1,1), (1,2,2), (1,2,3).

%e The a(30) = 3 minimal patterns avoiding (1,2,3) are: (1,1), (2,1), (1,2,3,4).

%Y The version for standard compositions is A335465.

%Y Patterns are counted by A000670.

%Y Sum of prime indices is A056239.

%Y Each number's prime indices are given in the rows of A112798.

%Y Patterns are ranked by A333217.

%Y Patterns matched by compositions are counted by A335456.

%Y Patterns matched by prime indices are counted by A335549.

%Y Patterns matched by partitions are counted by A335837.

%Y Cf. A124770, A124771, A181796, A269134, A299702, A333257, A335452, A335516.

%K nonn,more

%O 1,2

%A _Gus Wiseman_, Jun 26 2020