cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A129525 Numbers k such that all the digits of k^3 are distinct.

Original entry on oeis.org

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
Offset: 1

Views

Author

Tanya Khovanova, May 29 2007

Keywords

Examples

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

Programs

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