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.

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

This page as a plain text file.
%I A067971 #10 Jan 16 2024 03:21:32
%S A067971 1,5,25,105,678,2685,6631,17248,48056,109016,255085,576468,1026598,
%T A067971 2161819,4793623,10107506,21624889,46584891,100042239,215671305,
%U A067971 464309988,1000305876,2156229901,4642492109,10000266599
%N A067971 a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) properly contained in the digits of a(n+1)^3, with a(0)=1.
%e A067971 5^3 = 125 and 25 is the next smallest number whose cube (in this case 15625) properly contains the digits 1,2,5.
%Y A067971 Cf. A000578, A065297, A065298, A067972.
%K A067971 base,nonn
%O A067971 0,2
%A A067971 _Marc Paulhus_, Feb 05 2002
%E A067971 a(22)-a(24) from _Sean A. Irvine_, Jan 16 2024