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.

A235811 Numbers n such that n^3 has one or more occurrences of exactly nine different digits.

Original entry on oeis.org

1018, 1028, 1112, 1452, 1475, 1484, 1531, 1706, 1721, 1733, 1818, 1844, 1895, 1903, 2008, 2033, 2208, 2214, 2217, 2223, 2257, 2274, 2277, 2327, 2329, 2336, 2354, 2394, 2403, 2524, 2525, 2589, 2647, 2686, 2691, 2694, 2727, 2733, 2784, 2842, 2866, 2884, 2890
Offset: 1

Views

Author

Colin Barker, Jan 19 2014

Keywords

Examples

			1018 is in the sequence because 1018^3 = 1054977832, which contains exactly nine different digits.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[3000],Count[DigitCount[#^3],0]==1&] (* Harvey P. Dale, Dec 17 2021 *)
  • PARI
    s=[]; for(n=1, 3000, if(#vecsort(eval(Vec(Str(n^3))),,8)==9, s=concat(s, n))); s
    
  • Python
    A235811_list, m = [], [6, -6, 1, 0]
    for n in range(1,10**4+1):
        for i in range(3):
            m[i+1] += m[i]
        if len(set(str(m[-1]))) == 9:
            A235811_list.append(n) # Chai Wah Wu, Nov 05 2014