id:A095701 - OEIS Search Results

Search: id:A095701

Displaying 1-1 of 1 results found.

page 1

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.

+0
1

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 (list; graph; listen)

	OFFSET	`0,1`
	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: A002186 A125936 A161621 this_sequence A067992 A140757 A100035` `Adjacent sequences: A095698 A095699 A095700 this_sequence A095702 A095703 A095704`
	KEYWORD	`easy,nonn`
	AUTHOR	`Allan C. Wechsler (acw(AT)alum.mit.edu), Jul 06 2004`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research