A335511 Number of (1,1,1)-avoiding permutations of the prime indices of n.

1, 1, 1, 1, 1, 2, 1, 0, 1, 2, 1, 3, 1, 2, 2, 0, 1, 3, 1, 3, 2, 2, 1, 0, 1, 2, 0, 3, 1, 6, 1, 0, 2, 2, 2, 6, 1, 2, 2, 0, 1, 6, 1, 3, 3, 2, 1, 0, 1, 3, 2, 3, 1, 0, 2, 0, 2, 2, 1, 12, 1, 2, 3, 0, 2, 6, 1, 3, 2, 6, 1, 0, 1, 2, 3, 3, 2, 6, 1, 0, 0, 2, 1, 12, 2, 2

Offset: 1

Author

Gus Wiseman, Jun 19 2020

Keywords

• nonn

Comments

We define a 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).

Links

• Wikipedia, Permutation pattern
• Gus Wiseman, Sequences counting and ranking compositions by the patterns they match or avoid.

Crossrefs

Patterns avoiding this pattern are counted by A080599.

These compositions are counted by A232432.

The (1,1)-avoiding version is A335451.

The complement A335510 is the matching version.

These permutations are ranked by A335513.

Patterns are counted by A000670 and ranked by A333217.

Permutations of prime indices are counted by A008480.

Anti-run permutations of prime indices are counted by A335452.

Cf. A056239, A056986, A112798, A238279, A281188, A333221, A333755, A335456, A335460, A335462, A335463.

Programs

Mathematica

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[Permutations[primeMS[n]],!MatchQ[#,{_,x_,_,x_,_,x_,_}]&]],{n,100}]

Formula

If n is cubefree, a(n) = A008480(n), otherwise a(n) = 0.