A067714 - cp's OEIS frontend

A067714 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)=4.

%I A067714 #8 Jan 03 2024 16:09:07
%S A067714 4,49,1849,18496,134689,1338649,13380964,103693489,1036389249,
%T A067714 10283379649,102743968369,1003687392964,10026487930369,
%U A067714 100038463697929,1000274339968996,10003462899739969,100234979989639056
%N A067714 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)=4.
%C A067714 a(n) for n>0 remains the same when a(0)=9
%F A067714 a(n) = A065298(n)^2.
%Y A067714 Cf. A065298.
%K A067714 base,nonn
%O A067714 0,1
%A A067714 _Marc Paulhus_, Feb 05 2002

cp's OEIS Frontend

A067714 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)=4.