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.

A067711 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)=1.

Original entry on oeis.org

1, 16, 169, 1296, 12769, 237169, 1073296, 10329796, 109327936, 1353209796, 10193527369, 102179958336, 1003931857296, 10023359708961, 100035723189796, 1000257893937316, 10002783993738561, 100018367973835249
Offset: 0

Views

Author

Marc Paulhus, Feb 05 2002

Keywords

Crossrefs

Cf. A065297.

Formula

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