cp's OEIS Frontend

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

%I A335466 #13 Jun 30 2020 09:54:17
%S A335466 13,25,27,29,45,49,51,53,54,55,57,59,61,77,82,89,91,93,97,99,101,102,
%T A335466 103,105,107,108,109,110,111,113,115,117,118,119,121,123,125,141,153,
%U A335466 155,157,162,165,166,173,177,178,179,181,182,183,185,187,189,193,195
%N A335466 Numbers k such that the k-th composition in standard order (A066099) matches (1,2,1).
%C A335466 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 A335466 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 A335466 Wikipedia, <a href="https://en.wikipedia.org/wiki/Permutation_pattern">Permutation pattern</a>
%H A335466 Gus Wiseman, <a href="https://oeis.org/A102726/a102726.txt">Sequences counting and ranking compositions by the patterns they match or avoid.</a>
%H A335466 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 A335466 The sequence of terms together with the corresponding compositions begins:
%e A335466   13: (1,2,1)
%e A335466   25: (1,3,1)
%e A335466   27: (1,2,1,1)
%e A335466   29: (1,1,2,1)
%e A335466   45: (2,1,2,1)
%e A335466   49: (1,4,1)
%e A335466   51: (1,3,1,1)
%e A335466   53: (1,2,2,1)
%e A335466   54: (1,2,1,2)
%e A335466   55: (1,2,1,1,1)
%e A335466   57: (1,1,3,1)
%e A335466   59: (1,1,2,1,1)
%e A335466   61: (1,1,1,2,1)
%e A335466   77: (3,1,2,1)
%e A335466   82: (2,3,2)
%t A335466 stc[n_]:=Reverse[Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n,2]],1],0]]];
%t A335466 Select[Range[0,100],MatchQ[stc[#],{___,x_,___,y_,___,x_,___}/;x<y]&]
%Y A335466 The complement A335467 is the avoiding version.
%Y A335466 The (2,1,2)-matching version is A335468.
%Y A335466 These compositions are counted by A335470.
%Y A335466 Constant patterns are counted by A000005 and ranked by A272919.
%Y A335466 Permutations are counted by A000142 and ranked by A333218.
%Y A335466 Patterns are counted by A000670 and ranked by A333217.
%Y A335466 Non-unimodal compositions are counted by A115981 and ranked by A335373.
%Y A335466 Combinatory separations are counted by A269134 and ranked by A334030.
%Y A335466 Patterns matched by standard compositions are counted by A335454.
%Y A335466 Minimal patterns avoided by a standard composition are counted by A335465.
%Y A335466 Cf. A034691, A056986, A108917, A114994, A238279, A333224, A333257, A335446, A335456, A335458, A335509.
%K A335466 nonn
%O A335466 1,1
%A A335466 _Gus Wiseman_, Jun 15 2020