A067711 - cp's OEIS frontend

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.

%I A067711 #6 Jan 03 2024 15:15:45
%S A067711 1,16,169,1296,12769,237169,1073296,10329796,109327936,1353209796,
%T A067711 10193527369,102179958336,1003931857296,10023359708961,
%U A067711 100035723189796,1000257893937316,10002783993738561,100018367973835249
%N 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.
%F A067711 a(n) = A065297(n)^2.
%Y A067711 Cf. A065297.
%K A067711 base,nonn
%O A067711 0,2
%A A067711 _Marc Paulhus_, Feb 05 2002

cp's OEIS Frontend

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.