This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109167 a(n) = least nonnegative integer such that n appears a(n) times. 1
 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; text; internal format)
 OFFSET 0,2 COMMENTS The concatenation of the first four terms' (decimal) digits gives 1210 = A046043(1). LINKS EXAMPLE Note that we do not need to specify a(0) explicitly. Indeed, 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: A052922 A181930 A256797 * A066426 A100887 A073592 Adjacent sequences:  A109164 A109165 A109166 * A109168 A109169 A109170 KEYWORD nonn AUTHOR Rick L. Shepherd, Jun 20 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 20:55 EDT 2019. Contains 328224 sequences. (Running on oeis4.)