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.

A247794 a(n)^3 is the least cube to contain exactly n distinct digits.

Original entry on oeis.org

0, 3, 5, 12, 22, 59, 135, 289, 1018, 2326
Offset: 1

Views

Author

Derek Orr, Sep 23 2014

Keywords

Comments

"...at least n..." and "...exactly n..." yield the same sequence (i.e. this sequence is strictly increasing).

Crossrefs

Cf. A054039.

Programs