id:A116939 - OEIS Search Results

Search: id:A116939

Displaying 1-1 of 1 results found.

page 1

Lexicographically smallest sequence such that each i occurs exactly i+1 times and succeeding terms differ exactly by -1 or +1.

+0
5

0, 1, 2, 1, 2, 3, 2, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 6, 5, 6, 7, 6, 7, 6, 7, 6, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 9, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 13, 12, 13 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Permutation of A003056: a(n)=A003056(A116942(n)), a(A116941(n))=A003056(n);` `for n>1: let x = number of occurrences of the most frequent term so far, a(n) = if x=a(n-1) then x+1 else x, a(1) = 1;` `a(A000982(n))=a(A116940(n))=n, a(m)<n for m<A000982(n) and a(m)>n for m>A000982(n).`
	CROSSREFS	`Sequence in context: A053735 A033667 A033923 this_sequence A008611 A025798 A161064` `Adjacent sequences: A116936 A116937 A116938 this_sequence A116940 A116941 A116942`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 27 2006`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research