id:A084500 - OEIS Search Results

Search: id:A084500

Displaying 1-1 of 1 results found.

page 1

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

+0
7

0, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 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, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Also minimum i such that A084505(i) >= n. Tells that the n-th throw (n>=1) in A084501 belongs to the a(n):th lexicographical solution A084502(a(n)).`
	LINKS	`A. Karttunen, Scheme-program for computing this sequence`
	CROSSREFS	`Differs from A084557 first time at the 605th term, where A084500(605) = 130, while A084557(605) = 131. Cf. A084510, A084520.` `Sequence in context: A005041 A030530 A024417 this_sequence A084557 A060021 A000006` `Adjacent sequences: A084497 A084498 A084499 this_sequence A084501 A084502 A084503`
	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 July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research