The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A217535 Least number having in its decimal representation each digit n times. 1
 1023456789, 10012233445566778899, 100011222333444555666777888999, 1000011122223333444455556666777788889999, 10000011112222233333444445555566666777778888899999, 100000011111222222333333444444555555666666777777888888999999 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..100 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 Cf. A050278, A051018, A049363, A074205, A154566, A204047, A020666, A020667, A061604, A180489. A subsequence of A171102. Sequence in context: A051018 A020667 A154566 * A180489 A204047 A051264 Adjacent sequences:  A217532 A217533 A217534 * A217536 A217537 A217538 KEYWORD nonn,base,easy AUTHOR M. F. Hasler, Oct 05 2012 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 April 12 03:14 EDT 2021. Contains 342912 sequences. (Running on oeis4.)