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.

A110065 Numbers k such that 10^k - k is prime.

Original entry on oeis.org

3, 23, 171, 903, 9911, 48107, 48449, 60959
Offset: 1

Views

Author

Farideh Firoozbakht, Jul 11 2005

Keywords

Comments

For each n, a(n) == 3 (mod 6) or a(n) == 5 (mod 6).
There is no further term up to 16000. - Farideh Firoozbakht, Dec 02 2006
a(9) > 10^5. - Robert Price, Feb 19 2015

Crossrefs

Programs

  • PARI
    is(n)=isprime(10^n-n) \\ Charles R Greathouse IV, Feb 17 2017
    
  • Python
    from sympy import isprime
    def afind(limit):
      m, pow10 = 0, 1
      while m <= limit:
        if isprime(pow10 - m): print(m, end=", ")
        m, pow10 =  m + 1, pow10 * 10
    afind(1000) # Michael S. Branicky, Mar 23 2021

Extensions

a(5) from Farideh Firoozbakht, Dec 02 2006
Definition corrected by Farideh Firoozbakht, Dec 12 2006
a(6)-a(8) from Robert Price, Feb 19 2015