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!)
A129525 Numbers n such that all the digits of n^3 are distinct. 0

%I #5 Nov 21 2013 12:49:04

%S 1,2,3,4,5,6,8,9,12,13,16,17,18,19,21,22,24,27,29,32,35,38,41,59,66,

%T 69,73,75,76,84,88,93,97,135,145,203,289,297,302,319

%N Numbers n such that all the digits of n^3 are distinct.

%e 319^3 = 32461759, is the largest number with all different digits in its cube.

%t Select[Range[10000], Length[IntegerDigits[ # ^3]] == Length[Union[IntegerDigits[ # ^3]]] &]

%t Select[Range[10000],Max[DigitCount[#^3]]==1&] (* _Harvey P. Dale_, May 01 2012 *)

%K base,fini,full,nonn

%O 1,2

%A _Tanya Khovanova_, May 29 2007

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 July 22 05:01 EDT 2024. Contains 374480 sequences. (Running on oeis4.)