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 A029776 #20 Apr 04 2023 07:46:27 %S A029776 0,1,4,5,6,9,10,11,12,21,24,25,29,32,33,34,39,40,44,49,50,51,54,55,56, %T A029776 59,60,61,64,65,66,67,71,72,73,75,76,88,90,97,99,100,101,102,106,109, %U A029776 110,111,112,114,115,116,119,120,124,125,129,137,151,153,176 %N A029776 Digits of n appear in n^3. %H A029776 Robert Israel, <a href="/A029776/b029776.txt">Table of n, a(n) for n = 1..10000</a> %e A029776 66 is in the list because 66^3 = 287496 and 6 appears in 287496. %e A029776 153 is in the list because 153^3 = 3581577 and 1, 5, 3 appear in 3581577. %p A029776 filter:= n -> convert(convert(n,base,10),set) subset convert(convert(n^3,base,10),set):select(filter, [$0..200]); # _Robert Israel_, Mar 18 2020 %o A029776 (Magma) [n: n in [0..200] | Intseq(n) subset Intseq(n^3)]; // _Bruno Berselli_, Aug 01 2013 %o A029776 (PARI) isok(m) = my(d=Set(digits(m)), ddd=Set(digits(m^3))); setintersect(d, ddd) == d; \\ _Michel Marcus_, Mar 18 2020 %o A029776 (Python) %o A029776 from itertools import count, islice %o A029776 def A029776_gen(startvalue=0): # generator of terms >= startvalue %o A029776 return filter(lambda n:set(str(n)) <= set(str(n**3)), count(max(startvalue,0))) %o A029776 A029776_list = list(islice(A029776_gen(),20)) # _Chai Wah Wu_, Apr 03 2023 %Y A029776 Contains A119735. %K A029776 nonn,base %O A029776 1,3 %A A029776 _Patrick De Geest_ %E A029776 Offset changed to 1 by _Robert Israel_, Mar 18 2020