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!)
A217535 Least number having in its decimal representation each digit n times. 1

%I #7 Jun 25 2017 08:34:07

%S 1023456789,10012233445566778899,100011222333444555666777888999,

%T 1000011122223333444455556666777788889999,

%U 10000011112222233333444445555566666777778888899999,100000011111222222333333444444555555666666777777888888999999

%N Least number having in its decimal representation each digit n times.

%H Alois P. Heinz, <a href="/A217535/b217535.txt">Table of n, a(n) for n = 1..100</a>

%F a(n) ~ 10^(10n-1). See PARI code for an exact formula.

%p a:= n-> parse(cat(1,0$n,1$(n-1),seq(i$n, i=2..9))):

%p seq(a(n), n=1..10); # _Alois P. Heinz_, Jun 25 2017

%o (PARI) A217535(n)=sum(d=1,9,10^(n-(d==1))\9*d*10^(n*(9-d)))+10^(10*n-1)

%Y Cf. A050278, A051018, A049363, A074205, A154566, A204047, A020666, A020667, A061604, A180489.

%Y A subsequence of A171102.

%K nonn,base,easy

%O 1,1

%A _M. F. Hasler_, Oct 05 2012

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 25 10:51 EDT 2024. Contains 371967 sequences. (Running on oeis4.)