A119563 Define F(n) = 2^(2^n)+1 = n-th Fermat number, M(n) = 2^n-1 = the n-th Mersenne number. Then a(n) = F(n)+M(n)-1 = 2^(2^n) + 2^n - 1.

2, 5, 19, 263, 65551, 4294967327, 18446744073709551679, 340282366920938463463374607431768211583, 115792089237316195423570985008687907853269984665640564039457584007913129640191

Offset

0,1

Comments

The first 5 entries are primes. Are there infinitely many primes in this sequence?

Links

Table of n, a(n) for n=0..8.

Formula

a(n) = A119561(n)-2=A000215(n)+A000225(n)-1. - R. J. Mathar, Apr 22 2007

Example

F(2) = 2^(2^2)+1 = 17, M(2) = 2^2-1 = 3, F(2)+ M(2) - 1 = 19

Prog

(PARI) fm3(n) = for(x=0, n, y=2^(2^x)+2^x-1; print1(y", "))

Crossrefs

Sequence in context: A218386 A055813 A119550 * A270398 A269997 A270547

Adjacent sequences: A119560 A119561 A119562 * A119564 A119565 A119566

Keyword

nonn

Author

Cino Hilliard, May 31 2006

Extensions

Edited by N. J. A. Sloane, Jun 03 2006

Status

approved