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-3 of 3 results.

A157036 Shorthand for A157035, the largest prime with 2^n digits.

Original entry on oeis.org

3, 3, 27, 11, 63, 21, 51, 17, 813, 377, 7017, 27381, 7763, 1133, 119387, 67347, 121877
Offset: 0

Views

Author

Lekraj Beedassy, Feb 22 2009

Keywords

Comments

The actual prime A157035(n) is obtained as 10^(2^n) - a(n).

Crossrefs

Programs

  • Maple
    a:= n-> (t-> t-prevprime(t))(10^(2^n)):
    seq(a(n), n=0..10);  # Alois P. Heinz, Mar 02 2022
  • PARI
    { a(n) = 10^(2^n) - precprime(10^(2^n)) } \\ Max Alekseyev, Mar 28 2009
    
  • Python
    from sympy import prevprime
    def a(n): return 10**(2**n) - prevprime(10**(2**n))
    print([a(n) for n in range(10)]) # Michael S. Branicky, Mar 02 2022

Formula

a(n) = 10^(2^n) - A157035(n).
a(n) = A033874(2^n).

Extensions

a(8)-a(13) from Ray Chandler and Max Alekseyev, Mar 22 2009
a(14) from Jinyuan Wang, Feb 22 2022
a(15) from Michael S. Branicky, Jun 19 2024
a(16) from Michael S. Branicky, Jun 27 2024

A157033 Smallest prime with 2^n digits.

Original entry on oeis.org

2, 11, 1009, 10000019, 1000000000000037, 10000000000000000000000000000033, 1000000000000000000000000000000000000000000000000000000000000121
Offset: 0

Views

Author

Lekraj Beedassy, Feb 22 2009

Keywords

Crossrefs

Programs

  • Mathematica
    f[n_] := NextPrime[10^(2^n - 1)]; Table[f@n, {n, 0, 7}] (* Robert G. Wilson v, Mar 17 2009 *)

A157035 Largest prime with 2^n digits.

Original entry on oeis.org

7, 97, 9973, 99999989, 9999999999999937, 99999999999999999999999999999979, 9999999999999999999999999999999999999999999999999999999999999949
Offset: 0

Views

Author

Lekraj Beedassy, Feb 22 2009

Keywords

Crossrefs

Programs

  • Mathematica
    NextPrime[10^2^Range[0,6],-1] (* Harvey P. Dale, Dec 28 2023 *)
Showing 1-3 of 3 results.