id:A100798 - OEIS Search Results

Search: id:A100798

Displaying 1-1 of 1 results found.

page 1

n occurs n times, as early as possible subject to the constraint that two successive occurrences of n are separated by at least by n terms.

+0
4

1, 2, 3, 4, 2, 5, 3, 6, 4, 7, 3, 5, 8, 4, 6, 9, 10, 5, 4, 7, 11, 6, 8, 5, 12, 9, 13, 7, 6, 5, 10, 8, 11, 14, 15, 6, 7, 9, 12, 16, 8, 10, 6, 13, 7, 11, 17, 9, 14, 8, 15, 12, 7, 10, 18, 19, 16, 9, 8, 11, 7, 13, 20, 14, 10, 12, 15, 8, 9, 17, 21, 11, 22, 16, 18, 10, 8, 13, 9, 12, 14, 19, 15, 11 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Subsidiary sequences: first (A100919) and the last (A100920) occurrences of n.`
	EXAMPLE	`Index of the first occurrence of 2 is 2 and that of the second occurrence is 5, separated by a(3) and a(4), two terms.`
	CROSSREFS	`Cf. A100795, A061925, A074148.` `Sequence in context: A043264 A117826 A075994 this_sequence A121701 A026346 A120636` `Adjacent sequences: A100795 A100796 A100797 this_sequence A100799 A100800 A100801`
	KEYWORD	`easy,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 05 2004`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 08 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research