login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A335482 Numbers k such that the k-th composition in standard order (A066099) matches the pattern (2,3,1). 6
41, 81, 83, 89, 105, 145, 161, 163, 165, 166, 167, 169, 177, 179, 185, 209, 211, 217, 233, 289, 290, 291, 297, 305, 321, 323, 325, 326, 327, 329, 331, 332, 333, 334, 335, 337, 339, 345, 353, 355, 357, 358, 359, 361, 369, 371, 377, 401, 417, 419, 421, 422, 423 (list; graph; refs; listen; history; text; internal format)
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..53.

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:

41: (2,3,1)

81: (2,4,1)

83: (2,3,1,1)

89: (2,1,3,1)

105: (1,2,3,1)

145: (3,4,1)

161: (2,5,1)

163: (2,4,1,1)

165: (2,3,2,1)

166: (2,3,1,2)

167: (2,3,1,1,1)

169: (2,2,3,1)

177: (2,1,4,1)

179: (2,1,3,1,1)

185: (2,1,1,3,1)

MATHEMATICA

stc[n_]:=Reverse[Differences[Prepend[Join@@Position[Reverse[IntegerDigits[n, 2]], 1], 0]]];

Select[Range[0, 100], MatchQ[stc[#], {___, x_, ___, y_, ___, z_, ___}/; z<x<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: A224671 A044107 A044488 * A173550 A136072 A098061

Adjacent sequences: A335479 A335480 A335481 * A335483 A335484 A335485

KEYWORD

nonn

AUTHOR

Gus Wiseman, Jun 18 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 13:46 EST 2022. Contains 358700 sequences. (Running on oeis4.)