Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129525
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129525 Numbers n such that all the digits of n^3 are distinct. +0
1
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; listen)
OFFSET

1,2

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]]] &]

CROSSREFS

Sequence in context: A093110 A165707 A052063 this_sequence A084693 A121644 A002242

Adjacent sequences: A129522 A129523 A129524 this_sequence A129526 A129527 A129528

KEYWORD

base,fini,full,nonn

AUTHOR

Tanya Khovanova (tanyakh(AT)yahoo.com), May 29 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research