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

A378490 Least prime p such that p^(2^n) + 2^(2^n) is prime.

Original entry on oeis.org

3, 3, 3, 13, 89, 29, 37, 113, 113, 13, 1151, 43, 53, 5503
Offset: 0

Views

Author

Jean-Marc Rebert, Nov 28 2024

Keywords

Examples

			a(1) = 3, because 3^(2^1) + 2^(2^1) = 13 is prime and no smaller prime satisfies the condition.
		

Crossrefs

Programs

  • PARI
    a(n) = my(p=2, q=2^n); while (!ispseudoprime(p^q + 2^q), p=nextprime(p+1)); p; \\ Michel Marcus, Nov 28 2024

Formula

a(n) = A132260(n,1) for n>=3.
Showing 1-1 of 1 results.