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.

A065588 Smallest prime beginning with exactly n 5's.

Original entry on oeis.org

2, 5, 557, 5557, 555521, 555557, 55555517, 55555553, 5555555501, 5555555557, 5555555555057, 555555555551, 5555555555551, 555555555555529, 555555555555557, 55555555555555519, 5555555555555555021, 555555555555555559, 55555555555555555567, 5555555555555555555087
Offset: 0

Views

Author

Robert G. Wilson v, Nov 28 2001

Keywords

Crossrefs

Cf. A037063, A065584 - A065592. Different from A068105.

Programs

  • Python
    from sympy import isprime
    def a(n):
      if n < 2: return list([2, 5])[n]
      n5s, i, pow10, end_digits = int('5'*n), 1, 1, 0
      while True:
        i = 1
        while i < pow10:
          istr = str(i)
          if istr[0] == '5' and len(istr) == end_digits:
            i += 2 if pow10 <= 10 else pow10 // 10
          else:
            t = n5s * pow10 + i
            if isprime(t): return t
            i += 2
        pow10 *= 10; end_digits += 1
    print([a(n) for n in range(20)]) # Michael S. Branicky, Feb 05 2021, corrected Mar 03 2021

Extensions

Corrected by N. J. A. Sloane, Jan 11 2007 and by Don Reble, Jan 17 2007
Offset corrected by Michael S. Branicky, Feb 05 2021