id:A102823 - OEIS Search Results

Search: id:A102823

Displaying 1-1 of 1 results found.

page 1

"True already", base 10, start 0: a(n) is the least integer such that the sequence up to a(n-1) written in base 10 contains floor(a(n)/10) copies of the digit a(n) % 10, with a(0) = 0.

+0
8

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26, 27, 28, 29, 30, 34, 35, 36, 37, 38, 39, 40, 45, 46, 47, 48, 49, 50, 56, 57, 58, 59, 60, 67, 68, 69, 70, 78, 79, 80, 89, 90, 100, 102, 103, 104, 105, 106, 107, 108, 109, 112, 113 (list; graph; listen)

	OFFSET	`0,3`
	REFERENCES	`Inspired by discussion of "True so far" from Eric Angelini (A102357)`
	EXAMPLE	`The first 11 values of the sequence written in decimal include 2 '1's and 1 '2', so the next value cannot be 11 (the count of '1's is not 1) but can be 12.`
	CROSSREFS	`Cf. A102824-A102830, A102357.` `Sequence in context: A048737 A122260 A122254 this_sequence A004775 A004744 A072226` `Adjacent sequences: A102820 A102821 A102822 this_sequence A102824 A102825 A102826`
	KEYWORD	`nonn,easy,base`
	AUTHOR	`hv(AT)crypt.org (Hugo van der Sanden), Feb 26 2005`

page 1

Search completed in 0.002 seconds

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.

AT&T Labs Research