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.
%I A030289 #26 Dec 11 2019 20:42:45
%S A030289 0,1,8,27,64,125,343,512,4096,5832,64000,91125,300763,941192,3375000,
%T A030289 8489664,13312053,86444696669696,100175333300307,488224224494488,
%U A030289 510657175657000,2233398984434344,5177717000000000,6393843393228864
%N A030289 a(n+1) is the next larger cube with no digits in common with a(n), a(0) = 0.
%C A030289 From a(24) on, even-indexed terms are powers of 1000, odd-indexed terms are the next larger cube to a(n-1)*20/9 with no digit 0 or 1, cf. A030290. - _M. F. Hasler_, Nov 12 2017
%H A030289 David W. Wilson, <a href="/A030289/b030289.txt">Table of n, a(n) for n = 0..90</a>
%F A030289 a(n) = A030290(n)^3. - _David W. Wilson_, Nov 08 2017
%t A030289 bb={0}; idi1=IntegerDigits[0]; Do[idi=IntegerDigits[r=i^3]; If[Intersection[idi, idi1]=={}, bb={bb, r}; idi1=idi], {i, 1, 100000}]; fla=Flatten[bb] (* _Zak Seidov_, Feb 17 2005 *)
%t A030289 Nest[Append[#, Block[{k = Last@ # + 1, m = IntegerDigits[Last[#]^3]}, While[IntersectingQ[IntegerDigits[k^3], m], k++]; k]] &, {0}, 23]^3 (* _Michael De Vlieger_, Nov 13 2017 *)
%o A030289 (PARI) next_A030289(n,D(n)=Set(digits(n)),S=D(n))={if(n>6e15,S[1]&&return(1000^(logint(n,1000)+1));n=n*20\9); for(k=sqrtnint(n,3)+1,oo,#setintersect(D(k^3),S)||return(k^3))} \\ _M. F. Hasler_, Nov 12 2017
%Y A030289 Squares whose digits do not appear in previous term: A030288.
%Y A030289 Primes whose digits do not appear in previous term: A030284.
%Y A030289 Cf. A030290: cube roots of the terms.
%K A030289 nonn,base
%O A030289 0,3
%A A030289 _Patrick De Geest_