login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A217535
Least number having in its decimal representation each digit n times.
1
1023456789, 10012233445566778899, 100011222333444555666777888999, 1000011122223333444455556666777788889999, 10000011112222233333444445555566666777778888899999, 100000011111222222333333444444555555666666777777888888999999
OFFSET
1,1
LINKS
FORMULA
a(n) ~ 10^(10n-1). See PARI code for an exact formula.
MAPLE
a:= n-> parse(cat(1, 0$n, 1$(n-1), seq(i$n, i=2..9))):
seq(a(n), n=1..10); # Alois P. Heinz, Jun 25 2017
PROG
(PARI) A217535(n)=sum(d=1, 9, 10^(n-(d==1))\9*d*10^(n*(9-d)))+10^(10*n-1)
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
M. F. Hasler, Oct 05 2012
STATUS
approved