A095701 Define string S_0 to be the null sequence; string S_n is derived from string S_{n-1} by inserting n's in the rightmost n gaps; sequence gives limit S_n as n -> infinity.

2, 3, 1, 4, 3, 4, 5, 2, 5, 4, 6, 5, 6, 3, 6, 7, 5, 7, 6, 7, 4, 8, 7, 8, 6, 8, 7, 8, 9, 5, 9, 8, 9, 7, 9, 8, 10, 9, 10, 6, 10, 9, 10, 8, 10, 11, 9, 11, 10, 11, 7, 11, 10, 11, 9, 12, 11, 12, 10, 12, 11, 12, 8, 12, 11, 12, 13, 10, 13, 12, 13, 11, 13, 12, 13, 9, 13, 12, 14, 13, 14, 11, 14, 13, 14

Offset

0,1

Links

Table of n, a(n) for n=0..84.

Example

For example, S_4 = (2 3 1 4 3 4 2 4 3 4), S_5 = (2 3 1 4 3 4 5 2 5 4 5 3 5 4 5). This procedure leaves ever-lengthening initial subsequences untouched; this growing stable prefix forms the given sequence. Thus the sequence begins 2 3 1 4 3 4 ...

Crossrefs

Underlies A096063.

Cf. A096063.

Sequence in context: A200942 A286234 A161621 * A067992 A317024 A354803

Adjacent sequences: A095698 A095699 A095700 * A095702 A095703 A095704

Keyword

easy,nonn

Author

Allan C. Wechsler, Jul 06 2004

Status

approved