A335462 Number of (1,2,1) and (2,1,2)-matching permutations of the prime indices of n.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 1
Keywords
Examples
The a(n) permutations for n = 36, 72, 270, 144, 300: (1,2,1,2) (1,1,2,1,2) (2,1,2,3,2) (1,1,1,2,1,2) (1,2,3,1,3) (2,1,2,1) (1,2,1,1,2) (2,1,3,2,2) (1,1,2,1,1,2) (1,3,1,2,3) (1,2,1,2,1) (2,2,1,3,2) (1,1,2,1,2,1) (1,3,1,3,2) (2,1,1,2,1) (2,2,3,1,2) (1,2,1,1,1,2) (1,3,2,1,3) (2,1,2,1,1) (2,3,1,2,2) (1,2,1,1,2,1) (1,3,2,3,1) (2,3,2,1,2) (1,2,1,2,1,1) (2,1,3,1,3) (2,1,1,1,2,1) (2,3,1,3,1) (2,1,1,2,1,1) (3,1,2,1,3) (2,1,2,1,1,1) (3,1,2,3,1) (3,1,3,1,2) (3,1,3,2,1) (3,2,1,3,1)
Links
- Wikipedia, Permutation pattern
- Gus Wiseman, Sequences counting and ranking compositions by the patterns they match or avoid.
Crossrefs
The avoiding version is A333175.
Replacing "and" with "or" gives A335460.
Positions of nonzero terms are A335463.
Permutations of prime indices are counted by A008480.
STC-numbers of permutations of prime indices are A333221.
Patterns matched by standard compositions are counted by A335454.
Dimensions of downsets of standard compositions are A335465.
Comments