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.

A119735 Numbers n such that every digit occurs at least once in n^3.

Original entry on oeis.org

2326, 2535, 2795, 3123, 3506, 3909, 4602, 4782, 5027, 5048, 5196, 5362, 5394, 5402, 5437, 6215, 6221, 6517, 6687, 6789, 6802, 6993, 7061, 7202, 7219, 7616, 7638, 8124, 8244, 8248, 8288, 8384, 8402, 8443, 8496, 8499, 8817, 9006, 9048, 9142, 9374, 9476
Offset: 1

Views

Author

Dmitry Kamenetsky, Jun 15 2006

Keywords

Crossrefs

Cf. A030292.

Programs

  • Mathematica
    Select[Range[10000],Union[IntegerDigits[#^3]]==Range[0,9]&] (* Harvey P. Dale, Apr 11 2014 *)
  • PARI
    isok(n) = length(Set(digits(n^3))) == 10; \\ Michel Marcus, Aug 28 2013
    
  • Python
    A119735_list, m = [], [6, -6, 1, 0]
    for n in range(1,10**6+1):
        for i in range(3):
            m[i+1] += m[i]
        if len(set(str(m[-1]))) == 10:
            A119735_list.append(n) # Chai Wah Wu, Nov 05 2014