A335476 - OEIS

%I #8 Jun 29 2020 12:45:47

%S 14,28,29,30,46,54,56,57,58,59,60,61,62,78,84,92,93,94,102,108,109,

%T 110,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,142,

%U 156,157,158,168,169,172,174,180,182,184,185,186,187,188,189,190,198,204

%N Numbers k such that the k-th composition in standard order (A066099) matches the pattern (1,1,2).

%C A composition of n is a finite sequence of positive integers summing to n. The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.

%C 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).

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>

%H Gus Wiseman, <a href="https://docs.google.com/document/d/e/2PACX-1vTCPiJVFUXN8IqfLlCXkgP15yrGWeRhFS4ozST5oA4Bl2PYS-XTA3sGsAEXvwW-B0ealpD8qnoxFqN3/pub">Statistics, classes, and transformations of standard compositions</a>

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

%e The sequence of terms together with the corresponding compositions begins:

%e   14: (1,1,2)

%e   28: (1,1,3)

%e   29: (1,1,2,1)

%e   30: (1,1,1,2)

%e   46: (2,1,1,2)

%e   54: (1,2,1,2)

%e   56: (1,1,4)

%e   57: (1,1,3,1)

%e   58: (1,1,2,2)

%e   59: (1,1,2,1,1)

%e   60: (1,1,1,3)

%e   61: (1,1,1,2,1)

%e   62: (1,1,1,1,2)

%e   78: (3,1,1,2)

%e   84: (2,2,3)

%t stc[n_]:=Reverse[Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]];

%t Select[Range[0,100],MatchQ[stc[#],{___,x_,___,x_,___,y_,___}/;x<y]&]

%Y The complement A335522 is the avoiding version.

%Y The (2,1,1)-matching version is A335478.

%Y Patterns matching this pattern are counted by A335509 (by length).

%Y Permutations of prime indices matching this pattern are counted by A335446.

%Y These compositions are counted by A335470 (by sum).

%Y Constant patterns are counted by A000005 and ranked by A272919.

%Y Permutations are counted by A000142 and ranked by A333218.

%Y Patterns are counted by A000670 and ranked by A333217.

%Y Non-unimodal compositions are counted by A115981 and ranked by A335373.

%Y Combinatory separations are counted by A269134.

%Y Patterns matched by standard compositions are counted by A335454.

%Y Minimal patterns avoided by a standard composition are counted by A335465.

%Y Cf. A034691, A056986, A108917, A114994, A238279, A333224, A333257, A335446, A335456, A335458.

%K nonn

%O 1,1

%A _Gus Wiseman_, Jun 18 2020