id:A100795 - OEIS Search Results

Search: id:A100795

Displaying 1-1 of 1 results found.

page 1

n occurs n times, as early as possible subject to the constraint that no two successive terms are identical.

+0
4

1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 6, 7, 6, 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, 11, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 11, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 12, 13, 12 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`After a(8) = 4 the next term is 5 as 3 has already occurred three times.`
	CROSSREFS	`Cf. A061925, A074148, A100798.` `Adjacent sequences: A100792 A100793 A100794 this_sequence A100796 A100797 A100798` `Sequence in context: A086374 A123182 A069464 this_sequence A045781 A045670 A111439`
	KEYWORD	`easy,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 05 2004`
	EXTENSIONS	`Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 08 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research