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.

A080479 Smallest number formed by using all the digits (with multiplicity) of next n numbers.

Original entry on oeis.org

1, 23, 456, 10789, 1111112345, 101111226789, 22222222345678, 1022333333334569, 102333344444445789, 10234444455555556789, 1023455555666666666789, 102345666677777777777889, 10012345677888888888889999, 1000000011111122334455678999999999
Offset: 1

Views

Author

Amarnath Murthy, Mar 11 2003

Keywords

Crossrefs

Cf. A053067 (next n concatenated), A080480 (largest).

Programs

  • Python
    def a(n):
      s = "".join(sorted("".join(map(str, range((n-1)*n//2+1, n*(n+1)//2+1)))))
      if '0' not in s: return int(s)
      rz = s.rfind('0')
      return int(s[rz+1] + s[:rz+1] + s[rz+2:])
    print([a(n) for n in range(1, 15)]) # Michael S. Branicky, Jan 23 2021

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 19 2003