login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098281 Back-to-front insertion-permutation sequence; contains every finite sequence of distinct positive integers. 2
1, 1, 2, 2, 1, 1, 2, 3, 1, 3, 2, 3, 1, 2, 2, 1, 3, 2, 3, 1, 3, 2, 1, 1, 2, 3, 4, 1, 2, 4, 3, 1, 4, 2, 3, 4, 1, 2, 3, 1, 3, 2, 4, 1, 3, 4, 2, 1, 4, 3, 2, 4, 1, 3, 2, 3, 1, 2, 4, 3, 1, 4, 2, 3, 4, 1, 2, 4, 3, 1, 2, 2, 1, 3, 4, 2, 1, 4, 3, 2, 4, 1, 3, 4, 2, 1, 3, 2, 3, 1, 4, 2, 3, 4, 1, 2, 4, 3, 1, 4, 2, 3, 1, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Contains every finite sequence of distinct numbers...infinitely many times.

LINKS

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

FORMULA

Write 1. Then place 2 after 1 and then 2 before 1, yielding 12 and 21, as well as the first 5 terms of the sequence. Next, generate the 6 permutations of 1, 2, 3 by inserting 3 into 12 and then 21, from back-to-front, like this: 123, 132, 312 then 213, 231, 321. Next, generate the 24 permutations of 1, 2, 3, 4 by inserting 4 into the permutations of 1, 2, 3. Continue forever.

EXAMPLE

The permutations can be written as

1,

12, 21,

123, 132, 312, 213, 231, 321, etc.

Write them in order and insert commas.

CROSSREFS

Cf. A098280, A030298.

Sequence in context: A279522 A182592 A030298 * A207324 A103343 A085263

Adjacent sequences:  A098278 A098279 A098280 * A098282 A098283 A098284

KEYWORD

nonn

AUTHOR

Clark Kimberling, Sep 01 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 12:50 EDT 2018. Contains 316280 sequences. (Running on oeis4.)