cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1023456789, 10012233445566778899, 100011222333444555666777888999, 1000011122223333444455556666777788889999, 10000011112222233333444445555566666777778888899999, 100000011111222222333333444444555555666666777777888888999999
Offset: 1

Views

Author

M. F. Hasler, Oct 05 2012

Keywords

Crossrefs

Programs

  • 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
  • PARI
    A217535(n)=sum(d=1,9,10^(n-(d==1))\9*d*10^(n*(9-d)))+10^(10*n-1)

Formula

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