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

A065297

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

Terms

    a(0) =1a(1) =4a(2) =13a(3) =36a(4) =113a(5) =487a(6) =1036a(7) =3214a(8) =10456a(9) =36786a(10) =100963a(11) =319656a(12) =1001964a(13) =3165969a(14) =10001786a(15) =31626854a(16) =100013919a(17) =316256807a(18) =1000029656a(19) =3162322481a(20) =10000115537

External references