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.

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

Original entry on oeis.org

4, 49, 1849, 18496, 134689, 1338649, 3319684, 13380964, 30891364, 38390416, 93683041, 103693489, 139098436, 318693904, 433180969, 803949316, 1036389249, 1836293904, 2893041369, 3029841936, 3103269849, 3134096289, 3321908496
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. A067975.

Formula

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