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.

A067714 a(n+1) is the smallest square > 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)=4.

Original entry on oeis.org

4, 49, 1849, 18496, 134689, 1338649, 13380964, 103693489, 1036389249, 10283379649, 102743968369, 1003687392964, 10026487930369, 100038463697929, 1000274339968996, 10003462899739969, 100234979989639056
Offset: 0

Views

Author

Marc Paulhus, Feb 05 2002

Keywords

Comments

a(n) for n>0 remains the same when a(0)=9

Crossrefs

Cf. A065298.

Formula

a(n) = A065298(n)^2.