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