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 A030294 #26 May 05 2023 15:26:16 %S A030294 0,1,2,3,4,5,6,7,8,9,10,11,14,15,20,30,36,40,62,70,92,100,101,110,173, %T A030294 192,200,211,300,400,700,888,1000,1001,1010,1100,1920,2000,3000,3543, %U A030294 4000,7000,8880,10000,10001,10010,10100,11000,19200,20000,30000,35430,40000,70000,88800,100000,100001 %N A030294 Numbers k such that k^3 has at most three different digits. %C A030294 While almost all larger terms have a regular digit pattern, there is the exception a(63) = 146796, a(63)^3 = A030295(63) = 3163316636166336. Are there other terms of this type? - _Hugo Pfoertner_, Feb 11 2020 %H A030294 Hugo Pfoertner, <a href="/A030294/b030294.txt">Table of n, a(n) for n = 1..130</a> %t A030294 d3Q[n_]:=Count[DigitCount[n^3],_?(#>0&)]<4; Select[Range[0,110000],d3Q] (* _Harvey P. Dale_, Mar 10 2016 *) %t A030294 Select[Range[0,101000],Count[DigitCount[#^3],0]>6&] (* _Harvey P. Dale_, May 05 2023 *) %o A030294 (Magma) [n: n in [0..400000] | #Set(Intseq(n^3)) le 3]; // _Vincenzo Librandi_, Nov 10 2014 %o A030294 (PARI) for(n=0,10^9+1,if(#Set(digits(n^3))<=3,print1(n,", "))); \\ _Joerg Arndt_, Dec 13 2014 %Y A030294 Cf. A030295. %K A030294 nonn,base %O A030294 1,3 %A A030294 _Patrick De Geest_