cp's OEIS Frontend

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

%I A235811 #16 May 22 2025 10:21:36
%S A235811 1018,1028,1112,1452,1475,1484,1531,1706,1721,1733,1818,1844,1895,
%T A235811 1903,2008,2033,2208,2214,2217,2223,2257,2274,2277,2327,2329,2336,
%U A235811 2354,2394,2403,2524,2525,2589,2647,2686,2691,2694,2727,2733,2784,2842,2866,2884,2890
%N A235811 Numbers n such that n^3 has one or more occurrences of exactly nine different digits.
%H A235811 Colin Barker, <a href="/A235811/b235811.txt">Table of n, a(n) for n = 1..1000</a>
%e A235811 1018 is in the sequence because 1018^3 = 1054977832, which contains exactly nine different digits.
%t A235811 Select[Range[3000],Count[DigitCount[#^3],0]==1&] (* _Harvey P. Dale_, Dec 17 2021 *)
%o A235811 (PARI) s=[]; for(n=1, 3000, if(#vecsort(eval(Vec(Str(n^3))),,8)==9, s=concat(s, n))); s
%o A235811 (Python)
%o A235811 A235811_list, m = [], [6, -6, 1, 0]
%o A235811 for n in range(1,10**4+1):
%o A235811     for i in range(3):
%o A235811         m[i+1] += m[i]
%o A235811     if len(set(str(m[-1]))) == 9:
%o A235811         A235811_list.append(n) # _Chai Wah Wu_, Nov 05 2014
%Y A235811 Cf. A030292, A155146, A155147, A235807-A235810, A119735.
%K A235811 nonn,base
%O A235811 1,1
%A A235811 _Colin Barker_, Jan 19 2014