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.

Showing 1-4 of 4 results.

A052094 Smallest fourth powers whose decimal expansion digits occur with same frequency n.

Original entry on oeis.org

0, 1836036801, 289123718973983667216, 1051315345334684056886604801, 33065106952901022329359695121613056, 112265125207703310302573655130362165067776, 1010922420949465152104650155209626996061445542961
Offset: 1

Views

Author

Patrick De Geest, Jan 15 2000

Keywords

Comments

Terms calculated by Jeff Heleen.

Examples

			207^4 = 1836036801 and digits 0,1,3,6 and 8 each occur twice.
		

Crossrefs

Subsequence of A000583.

Programs

Extensions

Offset corrected by Michel Marcus, Aug 12 2015
a(6) corrected and a(7) from Michael S. Branicky, Dec 17 2020

A054212 a(n)^5 is the smallest fifth power whose decimal digits occur with same frequency n.

Original entry on oeis.org

0, 2955, 49995, 10365589, 75418384, 2592877410, 100661113419, 3989342709778, 2826734132736, 78074715540102
Offset: 1

Views

Author

Patrick De Geest, Feb 15 2000

Keywords

Comments

Terms calculated by Jeff Heleen.
Next term > 2.5*10^17 - Frank A. Stevenson, Feb 02 2024

Examples

			2955^5 = 225313610074846875 and digits 0, 1, 2, 3, 4, 5, 6, 7, and 8 each occur twice.
		

Crossrefs

Programs

  • Python
    def agen(POW=5):
      n = 1
      while True:
        k = 0
        while True:
          kpowstr = str(pow(k, POW))
          q, r = divmod(len(kpowstr), n)
          if r == 0:
            ok = True
            for d in set(kpowstr):
              if kpowstr.count(d) != n:
                ok = False; break
            if ok: break
            k += 1
          else: # go to next multiple of n digits: (q+1)*n
            k = max(k+1, int((10**((q+1)*n-1))**(1/POW)))
        yield k
        n += 1
    g = agen() # call with POW=4, 3, 2 for A052093, A052071, A052069
    print([next(g) for n in range(1, 5)]) # Michael S. Branicky, Dec 17 2020

Extensions

Offset corrected by Michel Marcus, Aug 12 2015
a(7)-a(8) from Michael S. Branicky, Dec 17 2020
a(9)-a(10) from Frank A. Stevenson, Jan 02 2024

A054213 Smallest fifth powers whose decimal expansion digits occur with same frequency n.

Original entry on oeis.org

0, 225313610074846875, 312343781246875156246875, 119665765800843104737370354851986949, 2439979134100773706931016420916722663424, 117195225794292252449115584887987847895470100000, 10334956410016814668660393585195309584134568401459883099, 1010431164918909763339703798486498718473866680301776494470190368
Offset: 1

Views

Author

Patrick De Geest, Feb 15 2000

Keywords

Comments

Terms calculated by Jeff Heleen.

Examples

			2955^5 = 225313610074846875 and digits 0, 1, 2, 3, 4, 5, 6, 7, and 8 each occur twice.
		

Crossrefs

Subsequence of A000584.

Programs

Extensions

Offset corrected by Michel Marcus, Aug 12 2015
a(6)-a(8) from Michael S. Branicky, Dec 17 2020

A052099 Smallest nonzero square with n distinct digits each occurring exactly n times.

Original entry on oeis.org

1, 7744, 100220121, 1001481404808481, 1000049919014961464966416, 100000011325773371773233151572525225, 1000000011111863263563888125532588566228326235536
Offset: 1

Views

Author

Patrick De Geest, Jan 15 2000

Keywords

Comments

Obviously can contain at most 10 terms.

Crossrefs

Cf. A052070. - R. J. Mathar, Oct 14 2008

Extensions

a(5) from Jon E. Schoenfield, Jul 17 2010
Offset corrected and a(6)-a(7) from Donovan Johnson, Apr 16 2011
Showing 1-4 of 4 results.