A067713 - cp's OEIS frontend

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

%I A067713 #5 Jan 03 2024 16:28:29
%S A067713 1,16,169,196,961,1296,2916,9216,12769,96721,237169,729316,1073296,
%T A067713 1630729,2709316,10329796,69739201,109327936,130279396,133079296,
%U A067713 133702969,309971236,317302969,917302369,1353209796,1725903936
%N A067713 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)=1.
%F A067713 a(n) = A014563(n)^2.
%Y A067713 Cf. A014563.
%K A067713 base,nonn
%O A067713 0,2
%A A067713 _Marc Paulhus_, Feb 05 2002

cp's OEIS Frontend

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