A067972 - cp's OEIS frontend

A067972 a(n+1) is the smallest cube > 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 A067972 #3 Jun 15 2014 16:40:39
%S A067972 1,125,15625,1157625,311665752,19356769125,291566137591,5131167956992,
%T A067972 110979523759616,1295599371716096,16597961902739125,
%U A067972 191569168079975232,1081935177662959192,10103177625989916259,110151807092929695367
%N A067972 a(n+1) is the smallest cube > 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 A067972 A067971^3
%Y A067972 Cf. A067971.
%K A067972 base,nonn
%O A067972 0,2
%A A067972 _Marc Paulhus_, Feb 05 2002

cp's OEIS Frontend

A067972 a(n+1) is the smallest cube > 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.