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.

A255678 Smallest number m needing exactly n distinct digits in decimal representation of m*(m+1)/2.

Original entry on oeis.org

0, 4, 14, 45, 143, 452, 1431, 4549, 14334, 46097
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 11 2015

Keywords

Comments

A118668(a(n)) = n and A118668(m) <> n for m < a(n).

Crossrefs

Cf. A118668, A260214 (the resulting triangular numbers).

Programs

  • Haskell
    a255678 n = head $ filter ((== n) . a118668) [0..]