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 A342975 #37 Nov 19 2021 15:53:16 %S A342975 0,1,1000,1331,1000000,1030301,1331000,1000000000,1003003001, %T A342975 1030301000,1331000000,1000000000000,1000300030001,1003003001000, %U A342975 1030301000000,1331000000000,1000000000000000,1000030000300001,1000300030001000,1003003001000000,1030301000000000,1331000000000000 %N A342975 Cubes composed of digits {0, 1, 3}. %C A342975 This sequence is infinite, because if m > 0 is a term, 1000*m will also be a term. %t A342975 Select[Range[0, 110000]^3, AllTrue[IntegerDigits[#], MemberQ[{0, 1, 3}, #1] &] &] (* _Amiram Eldar_, Nov 19 2021 *) %o A342975 (C#) public static void Main() %o A342975 { %o A342975 for(ulong num = 0; num < 2000000; num++) %o A342975 { %o A342975 ulong sq = num * num * num; %o A342975 string sq1 = sq + ""; %o A342975 bool p = true; %o A342975 string un = "2456789"; %o A342975 for(int a = 0; a < un.Length; a++) %o A342975 { %o A342975 if(sq1.Contains(un[a])) p = false; %o A342975 } %o A342975 if(p) %o A342975 { %o A342975 Console.Write(sq1 + ", "); %o A342975 } %o A342975 } %o A342975 Console.WriteLine("done"); %o A342975 } %o A342975 (Python) %o A342975 from itertools import islice, count %o A342975 def A342975(): return filter(lambda n: set(str(n)) <= {'0','1','3'},(n**3 for n in count(0))) %o A342975 A342975_list = list(islice(A342975(),20)) # _Chai Wah Wu_, Nov 19 2021 %Y A342975 Subsequence of A000578 and A043681. %K A342975 nonn,base %O A342975 1,3 %A A342975 _Daniel Blam_, Nov 19 2021