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.

A067972 a(n+1) is the smallest cube > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1.

Original entry on oeis.org

1, 125, 15625, 1157625, 311665752, 19356769125, 291566137591, 5131167956992, 110979523759616, 1295599371716096, 16597961902739125, 191569168079975232, 1081935177662959192, 10103177625989916259, 110151807092929695367
Offset: 0

Views

Author

Marc Paulhus, Feb 05 2002

Keywords

Crossrefs

Cf. A067971.

Formula