login
This site is supported by donations 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
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, 69, 73, 75, 76, 84, 88, 93, 97, 135, 145, 203, 289, 297, 302, 319 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..40.

EXAMPLE

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

MATHEMATICA

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

Select[Range[10000], Max[DigitCount[#^3]]==1&] (* Harvey P. Dale, May 01 2012 *)

CROSSREFS

Sequence in context: A093110 A165707 A052063 * A258023 A190232 A084693

Adjacent sequences:  A129522 A129523 A129524 * A129526 A129527 A129528

KEYWORD

base,fini,full,nonn

AUTHOR

Tanya Khovanova, May 29 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified June 28 15:17 EDT 2017. Contains 288838 sequences.