A335470 -id:A335470 - cp's OEIS frontend

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

11, 19, 23, 27, 35, 39, 43, 45, 46, 47, 51, 55, 59, 67, 71, 74, 75, 77, 78, 79, 83, 87, 89, 91, 92, 93, 94, 95, 99, 103, 107, 109, 110, 111, 115, 119, 123, 131, 135, 138, 139, 141, 142, 143, 147, 149, 150, 151, 153, 154, 155, 156, 157, 158, 159, 163, 167, 171

Offset: 1

Gus Wiseman, Jun 18 2020

nonn

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

			The sequence of terms together with the corresponding compositions begins:
  11: (2,1,1)
  19: (3,1,1)
  23: (2,1,1,1)
  27: (1,2,1,1)
  35: (4,1,1)
  39: (3,1,1,1)
  43: (2,2,1,1)
  45: (2,1,2,1)
  46: (2,1,1,2)
  47: (2,1,1,1,1)
  51: (1,3,1,1)
  55: (1,2,1,1,1)
  59: (1,1,2,1,1)
  67: (5,1,1)
  71: (4,1,1,1)

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

The complement A335523 is the avoiding version.
The (1,1,2)-matching version is A335476.
Patterns matching this pattern are counted by A335509 (by length).
Permutations of prime indices matching this pattern are counted by A335516.
These compositions are counted by A335470 (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.
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.
Cf. A034691, A056986, A108917, A114994, A238279, A333224, A333257, A335446, A335456, A335458, A335475.

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

A374254 Numbers k such that the k-th composition in standard order is an anti-run and matches the patterns (1,2,1) or (2,1,2).

Original entry on oeis.org

13, 22, 25, 45, 49, 54, 76, 77, 82, 89, 97, 101, 102, 105, 108, 109, 141, 148, 150, 153, 162, 165, 166, 177, 178, 180, 182, 193, 197, 198, 204, 205, 209, 210, 216, 217, 269, 278, 280, 281, 297, 300, 301, 305, 306, 308, 310, 322, 325, 326, 332, 333, 353, 354

Offset: 1

Gus Wiseman, Jul 14 2024

nonn

Such a composition cannot be strict.

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.

			The terms together with their standard compositions begin:
   13: (1,2,1)
   22: (2,1,2)
   25: (1,3,1)
   45: (2,1,2,1)
   49: (1,4,1)
   54: (1,2,1,2)
   76: (3,1,3)
   77: (3,1,2,1)
   82: (2,3,2)
   89: (2,1,3,1)
   97: (1,5,1)
  101: (1,3,2,1)
  102: (1,3,1,2)
  105: (1,2,3,1)
  108: (1,2,1,3)
  109: (1,2,1,2,1)
  141: (4,1,2,1)
  148: (3,2,3)
  150: (3,2,1,2)
  153: (3,1,3,1)

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

Compositions of this type are counted by A285981.
Permutations of prime indices of this type are counted by A335460.
This is the anti-run complement case of A374249, counted by A274174.
This is the anti-run case of A374253, counted by A335548.
A003242 counts anti-run compositions, ranks A333489.
A011782 counts compositions.
A025047 counts wiggly compositions, ranks A345167.
A066099 lists compositions in standard order.
A124767 counts runs in standard compositions, anti-runs A333381.
A233564 ranks strict compositions, counted by A032020.
A333755 counts compositions by number of runs.
A335454 counts patterns matched by standard compositions.
A335456 counts patterns matched by compositions.
A335462 counts (1,2,1)- and (2,1,2)-matching permutations of prime indices.
A335465 counts minimal patterns avoided by a standard composition.
- A335470 counts (1,2,1)-matching compositions, ranks A335466.
- A335471 counts (1,2,1)-avoiding compositions, ranks A335467.
- A335472 counts (2,1,2)-matching compositions, ranks A335468.
- A335473 counts (2,1,2)-avoiding compositions, ranks A335469.
A373948 encodes run-compression using compositions in standard order.
A373949 counts compositions by run-compressed sum, opposite A373951.
A373953 gives run-compressed sum of standard compositions, excess A373954.
Cf. A106356, A124762, A238130, A238279, A261982, A333175, A333382, A333627, A335463, A335524, A335525.

stc[n_]:=Differences[Prepend[Join @@ Position[Reverse[IntegerDigits[n,2]],1],0]]//Reverse;
Select[Range[0,100],Length[Split[stc[#]]] == Length[stc[#]]&&!UnsameQ@@First/@Split[stc[#]]&]

Equals A333489 /\ A374253.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica