A109167 - OEIS

This site is supported by donations to The OEIS Foundation.

A109167

Least nonnegative integer such that n appears a(n) times.

1, 2, 1, 0, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 18 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`The concatenation of the first four terms' (decimal) digits gives 1210 = A046043(0).`
	EXAMPLE	`a(0) = 1 as it cannot be 0. a(1) = 2 as it cannot be 0 or 1.`
	CROSSREFS	`Cf. A046043 (Autobiographical numbers), A001462 (Golomb's sequence).` `Sequence in context: A049243 A077908 A052922 * A066426 A100887 A073592` `Adjacent sequences: A109164 A109165 A109166 * A109168 A109169 A109170`
	KEYWORD	`nonn`
	AUTHOR	`Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jun 20 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.