login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109167 a(n) = least nonnegative integer such that n appears a(n) times. 1

%I #7 Jun 15 2014 14:46:41

%S 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,

%T 10,10,11,11,11,11,11,12,12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,

%U 14,14,15,15,15,15,15,15,16,16,16,16,16,16,16,17,17,17,17,17,17,17,18

%N a(n) = least nonnegative integer such that n appears a(n) times.

%C The concatenation of the first four terms' (decimal) digits gives 1210 = A046043(1).

%e 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.

%Y Cf. A046043 (Autobiographical numbers), A001462 (Golomb's sequence).

%K nonn

%O 0,2

%A _Rick L. Shepherd_, Jun 20 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 07:34 EDT 2024. Contains 371905 sequences. (Running on oeis4.)