id:A084510 - OEIS Search Results

Search: id:A084510

Displaying 1-1 of 1 results found.

page 1

a(0)=0, after which each n occurs A084516(n) times.

+0
5

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

	OFFSET	`0,3`
	COMMENT	`Also minimum i such that A084515(i) >= n. Tells that the n-th throw (n>=1) in A084511 belongs to the a(n):th lexicographical solution A084512(a(n)).`
	LINKS	`A. Karttunen, Scheme-program for computing this sequence`
	CROSSREFS	`Differs from A084520 first time at the 65th term, where A084510(65) = 19, while A084520(65) = 18. Cf. A084500.` `Adjacent sequences: A084507 A084508 A084509 this_sequence A084511 A084512 A084513` `Sequence in context: A047744 A054846 A084520 this_sequence A053620 A057360 A057364`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (my_firstname.my_surname(AT)iki.fi) Jun 02 2003`

page 1

Search completed in 0.002 seconds

Last modified November 21 00:02 EST 2008. Contains 150810 sequences.

AT&T Labs Research