cp's OEIS Frontend

A235810 Numbers n such that n^3 has one or more occurrences of exactly eight different digits.

%I A235810 #17 May 22 2025 10:21:36
%S A235810 289,297,302,319,467,494,515,557,562,595,621,623,676,682,709,712,721,
%T A235810 862,887,909,939,945,949,963,984,987,1012,1015,1016,1025,1029,1043,
%U A235810 1049,1065,1075,1087,1104,1106,1107,1114,1118,1132,1137,1154,1161,1167,1178
%N A235810 Numbers n such that n^3 has one or more occurrences of exactly eight different digits.
%H A235810 Colin Barker, <a href="/A235810/b235810.txt">Table of n, a(n) for n = 1..1000</a>
%e A235810 289 is in the sequence because 289^3 = 24137569, which contains exactly eight different digits.
%o A235810 (PARI) s=[]; for(n=1, 1500, if(#vecsort(eval(Vec(Str(n^3))),,8)==8, s=concat(s, n))); s
%o A235810 (Python)
%o A235810 A235810_list, m = [], [6, -6, 1, 0]
%o A235810 for n in range(1,10**3+1):
%o A235810     for i in range(3):
%o A235810         m[i+1] += m[i]
%o A235810     if len(set(str(m[-1]))) == 8:
%o A235810         A235810_list.append(n) # _Chai Wah Wu_, Nov 05 2014
%o A235810 (Magma) [n: n in [0..1200] | #Set(Intseq(n^3)) eq 8]; // _Vincenzo Librandi_, Nov 07 2014
%Y A235810 Cf. A030292, A155146, A155147, A235807-A235809, A235811, A119735.
%K A235810 nonn,base
%O A235810 1,1
%A A235810 _Colin Barker_, Jan 19 2014