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.

A052072 Smallest cubes whose digits occur with the same frequency n.

Original entry on oeis.org

0, 1331, 700227072, 22676697737363992239, 1728999927211172788179288, 256263633328535368685258882625, 19194114355415391344355399945943513, 2342441231418833141828248411332348812823
Offset: 1

Views

Author

Patrick De Geest, Jan 15 2000

Keywords

Examples

			22676697737363992239 (= 2830479^3) and its digits 2, 3, 6, 7 and 9 each occur four times.
		

Crossrefs

Programs

  • Mathematica
    Table[i = 0;
    While[x = i^3; Union@DeleteCases[DigitCount[x], 0] != {n}, i++];
    x, {n, 7}] (* Robert Price, Oct 12 2019 *)
    Select[Range[400]^3,Length[Union[DeleteCases[DigitCount[#],0]]]==1&] (* Harvey P. Dale, Apr 30 2022 *)
  • Python
    def A052072(n):
        a, b, c = 0, 0, 0
        for i in range(10**9):
            s = str(c)
            for d in set(s):
                if s.count(d) != n:
                    break
            else:
                return c
            c += a + b + 1
            b += 2*a + 3
            a += 3
        return 'search limit reached.'  # Chai Wah Wu, Aug 11 2015

Extensions

Offset corrected by Michel Marcus, Aug 12 2015
a(7) from Giovanni Resta, Aug 19 2018
a(8) from Mihael Tunik, May 26 2025