cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A067973 #4 Jun 15 2014 16:40:39
%S A067973 1,5,8,25,105,678,2685,6631,17248,48056,109016,255085,576468,993996,
%T A067973 1026598,1029697,1061509,1089598,1231339,1374358,1753291,1832389,
%U A067973 1896319,2161819,2162446,2163199,2231416,2263201,2264893,2674003
%N A067973 a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) contained in the digits of a(n+1)^3, with a(0)=1.
%C A067973 If "contained in" is replaced by "properly contained in" we get A067971.
%e A067973 5^3 = 125 and 8 is the next smallest number whose cube (in this case 512) that contains the digits 1,2,5.
%Y A067973 Cf. A067971, A065298, A067974, A014563, A065297.
%K A067973 base,nonn
%O A067973 0,2
%A A067973 _Marc Paulhus_, Feb 05 2002