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.

A159260 Numbers k such that 1 + Sum_{i=1..k} 2^prime(i) is prime.

Original entry on oeis.org

1, 2, 4, 5, 8, 43, 127, 251, 1903
Offset: 1

Views

Author

T. D. Noe, Apr 07 2009

Keywords

Comments

See A159261 for the primes produced by these n. See A159262 for prime(n), the largest exponent in the sum. The term 1903 produces a probable prime; smaller n produce provable primes. See A122035 for the reducibility of the polynomial obtained by replacing 2 by x.

Examples

			1 is here because 1 + 2^2 = 5 is prime.
2 is here because 1 + 2^2 + 2^3 = 13 is prime.
4 is here because 1 + 2^2 + 2^3 + 2^5 + 2^7 = 173 is prime.
5 is here because 1 + 2^2 + 2^3 + 2^5 + 2^7 + 2^11 = 2111 is prime.
		

Programs

  • Mathematica
    s=1; Reap[Do[s=s+2^Prime[n]; If[PrimeQ[s], Sow[n]], {n,2000}]][[2,1]]
Showing 1-1 of 1 results.