login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A235807 Numbers n such that n^3 has one or more occurrences of exactly five different digits. 5

%I #17 Sep 08 2022 08:46:06

%S 22,24,27,29,32,35,38,41,47,48,49,51,52,54,55,57,61,63,65,71,72,82,85,

%T 87,89,94,96,102,103,104,105,108,109,119,120,123,125,126,127,130,133,

%U 134,136,137,138,141,143,144,149,152,153,154,155,158,162,165,167

%N Numbers n such that n^3 has one or more occurrences of exactly five different digits.

%H Colin Barker, <a href="/A235807/b235807.txt">Table of n, a(n) for n = 1..1000</a>

%e 22 is in the sequence because 22^3 = 10648, which contains exactly five different digits: 0, 1, 4, 6, 8.

%e 87 is in the sequence because 87^3 = 658503, which contains exactly five different digits: 0, 3, 5, 6, 8.

%t Select[Range[200], Length[Union[IntegerDigits[#^3]]] == 5 &] (* _Bruno Berselli_, Jan 19 2014 *)

%o (PARI) s=[]; for(n=1, 200, if(#vecsort(eval(Vec(Str(n^3))),,8)==5, s=concat(s, n))); s

%o (Magma) [n: n in [0..200] | #Set(Intseq(n^3)) eq 5]; // _Bruno Berselli_, Jan 19 2014

%o (Python)

%o A235807_list, m = [], [6, -6, 1, 0]

%o for n in range(1,10**5+1):

%o ....for i in range(3):

%o ........m[i+1] += m[i]

%o ....if len(set(str(m[-1]))) == 5:

%o ........A235807_list.append(n) # _Chai Wah Wu_, Nov 05 2014

%Y Cf. A030292, A155146, A155147, A235808-A235811, A119735.

%K nonn,base

%O 1,1

%A _Colin Barker_, Jan 19 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)