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

50, 98, 101, 102, 114, 178, 194, 196, 197, 198, 202, 203, 205, 206, 210, 226, 229, 230, 242, 306, 324, 354, 357, 358, 370, 386, 388, 389, 390, 393, 394, 395, 396, 397, 398, 402, 404, 405, 406, 407, 410, 411, 413, 414, 418, 421, 422, 434, 450, 452, 453, 454

Offset

1,1

Comments

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.

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

Table of n, a(n) for n=1..52.

Wikipedia, Permutation pattern

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

Gus Wiseman, Statistics, classes, and transformations of standard compositions

Example

The sequence of terms together with the corresponding compositions begins:
   50: (1,3,2)
   98: (1,4,2)
  101: (1,3,2,1)
  102: (1,3,1,2)
  114: (1,1,3,2)
  178: (2,1,3,2)
  194: (1,5,2)
  196: (1,4,3)
  197: (1,4,2,1)
  198: (1,4,1,2)
  202: (1,3,2,2)
  203: (1,3,2,1,1)
  205: (1,3,1,2,1)
  206: (1,3,1,1,2)
  210: (1,2,3,2)

Mathematica

stc[n_]:=Reverse[Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n, 2]], 1], 0]]];
Select[Range[0, 100], MatchQ[stc[#], {___, x_, ___, y_, ___, z_, ___}/; x<z<y]&]

Crossrefs

The version counting permutations is A056986.

Patterns matching this pattern are counted by A335515 (by length).

Permutations of prime indices matching this pattern are counted by A335520.

These compositions are counted by A335514 (by sum).

Constant patterns are counted by A000005 and ranked by A272919.

Permutations are counted by A000142 and ranked by A333218.

Patterns are counted by A000670 and ranked by A333217.

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

Permutations matching (1,3,2,4) are counted by A158009.

Combinatory separations are counted by A269134.

Patterns matched by standard compositions are counted by A335454.

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

Other permutations:

- A335479 (1,2,3)

- A335480 (1,3,2)

- A335481 (2,1,3)

- A335482 (2,3,1)

- A335483 (3,1,2)

- A335484 (3,2,1)

Cf. A034691, A056986, A108917, A114994, A158005, A238279, A333224, A333257, A334968, A335456, A335458.

Sequence in context: A224551 A262149 A228953 * A375137 A255585 A260901

Adjacent sequences: A335477 A335478 A335479 * A335481 A335482 A335483

Keyword

nonn

Author

Gus Wiseman, Jun 18 2020

Status

approved