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 A119735 #17 Oct 21 2024 20:24:50 %S A119735 2326,2535,2795,3123,3506,3909,4602,4782,5027,5048,5196,5362,5394, %T A119735 5402,5437,6215,6221,6517,6687,6789,6802,6993,7061,7202,7219,7616, %U A119735 7638,8124,8244,8248,8288,8384,8402,8443,8496,8499,8817,9006,9048,9142,9374,9476 %N A119735 Numbers n such that every digit occurs at least once in n^3. %H A119735 T. D. Noe, <a href="/A119735/b119735.txt">Table of n, a(n) for n = 1..10000</a> %t A119735 Select[Range[10000],Union[IntegerDigits[#^3]]==Range[0,9]&] (* _Harvey P. Dale_, Apr 11 2014 *) %o A119735 (PARI) isok(n) = length(Set(digits(n^3))) == 10; \\ _Michel Marcus_, Aug 28 2013 %o A119735 (Python) %o A119735 A119735_list, m = [], [6, -6, 1, 0] %o A119735 for n in range(1,10**6+1): %o A119735 for i in range(3): %o A119735 m[i+1] += m[i] %o A119735 if len(set(str(m[-1]))) == 10: %o A119735 A119735_list.append(n) # _Chai Wah Wu_, Nov 05 2014 %Y A119735 Cf. A030292. %K A119735 base,nonn %O A119735 1,1 %A A119735 _Dmitry Kamenetsky_, Jun 15 2006