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.

A226281 Least number k such that 3^(2^i) + k is prime for i = 0,1,..,n-1.

Original entry on oeis.org

2, 2, 2, 2, 58, 440, 18248, 2024098, 4263330280, 22836544460, 40728071843930
Offset: 1

Views

Author

Robin Garcia, Jun 02 2013

Keywords

Comments

Generalized Fermat primes of the form b^(2^i) + k.

Examples

			a(5) = 58 because k = 58 is the minimal k such that  N = 3^(2^i) + k is prime for i = 0, 1, 2 ,3 ,4; N = 61, 67, 139, 6619, 43046779. But 3^(2^5) + 58 is divisible by 37 and three other primes.
		

Crossrefs

Extensions

a(11) from Giovanni Resta, Jun 17 2013