OFFSET
1,1
COMMENTS
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.
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
EXAMPLE
The sequence of terms together with the corresponding compositions begins:
14: (1,1,2)
28: (1,1,3)
29: (1,1,2,1)
30: (1,1,1,2)
46: (2,1,1,2)
54: (1,2,1,2)
56: (1,1,4)
57: (1,1,3,1)
58: (1,1,2,2)
59: (1,1,2,1,1)
60: (1,1,1,3)
61: (1,1,1,2,1)
62: (1,1,1,1,2)
78: (3,1,1,2)
84: (2,2,3)
MATHEMATICA
stc[n_]:=Reverse[Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n, 2]], 1], 0]]];
Select[Range[0, 100], MatchQ[stc[#], {___, x_, ___, x_, ___, y_, ___}/; x<y]&]
CROSSREFS
The complement A335522 is the avoiding version.
The (2,1,1)-matching version is A335478.
Patterns matching this pattern are counted by A335509 (by length).
Permutations of prime indices matching this pattern are counted by A335446.
These compositions are counted by A335470 (by sum).
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.
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jun 18 2020
STATUS
approved