cp's OEIS Frontend

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

%I A335479 #10 Jun 29 2020 17:47:18
%S A335479 52,104,105,108,116,180,200,208,209,210,211,212,216,217,220,232,233,
%T A335479 236,244,308,328,360,361,364,372,400,401,404,408,416,417,418,419,420,
%U A335479 421,422,423,424,425,428,432,433,434,435,436,440,441,444,456,464,465,466
%N A335479 Numbers k such that the k-th composition in standard order (A066099) matches the pattern (1,2,3).
%C A335479 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 A335479 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 A335479 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>
%H A335479 Gus Wiseman, <a href="https://oeis.org/A102726/a102726.txt">Sequences counting and ranking compositions by the patterns they match or avoid.</a>
%H A335479 Gus Wiseman, <a href="https://docs.google.com/document/d/e/2PACX-1vTCPiJVFUXN8IqfLlCXkgP15yrGWeRhFS4ozST5oA4Bl2PYS-XTA3sGsAEXvwW-B0ealpD8qnoxFqN3/pub">Statistics, classes, and transformations of standard compositions</a>
%e A335479 The sequence of terms together with the corresponding compositions begins:
%e A335479    52: (1,2,3)
%e A335479   104: (1,2,4)
%e A335479   105: (1,2,3,1)
%e A335479   108: (1,2,1,3)
%e A335479   116: (1,1,2,3)
%e A335479   180: (2,1,2,3)
%e A335479   200: (1,3,4)
%e A335479   208: (1,2,5)
%e A335479   209: (1,2,4,1)
%e A335479   210: (1,2,3,2)
%e A335479   211: (1,2,3,1,1)
%e A335479   212: (1,2,2,3)
%e A335479   216: (1,2,1,4)
%e A335479   217: (1,2,1,3,1)
%e A335479   220: (1,2,1,1,3)
%t A335479 stc[n_]:=Reverse[Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]];
%t A335479 Select[Range[0,100],MatchQ[stc[#],{___,x_,___,y_,___,z_,___}/;x<y<z]&]
%Y A335479 The version counting permutations is A056986.
%Y A335479 Patterns matching this pattern are counted by A335515 (by length).
%Y A335479 Permutations of prime indices matching this pattern are counted by A335520.
%Y A335479 These compositions are counted by A335514 (by sum).
%Y A335479 Constant patterns are counted by A000005 and ranked by A272919.
%Y A335479 Permutations are counted by A000142 and ranked by A333218.
%Y A335479 Patterns are counted by A000670 and ranked by A333217.
%Y A335479 Non-unimodal compositions are counted by A115981 and ranked by A335373.
%Y A335479 Combinatory separations are counted by A269134.
%Y A335479 Patterns matched by standard compositions are counted by A335454.
%Y A335479 Minimal patterns avoided by a standard composition are counted by A335465.
%Y A335479 Other permutations:
%Y A335479 - A335479 (1,2,3)
%Y A335479 - A335480 (1,3,2)
%Y A335479 - A335481 (2,1,3)
%Y A335479 - A335482 (2,3,1)
%Y A335479 - A335483 (3,1,2)
%Y A335479 - A335484 (3,2,1)
%Y A335479 Cf. A034691, A056986, A108917, A114994, A158005, A238279, A333224, A333257, A334968, A335456, A335458.
%K A335479 nonn
%O A335479 1,1
%A A335479 _Gus Wiseman_, Jun 18 2020