login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119561 Define F(n) = 2^(2^n)+1 = the 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)+1+2^n-1+1 = 2^(2^n)+2^n+1 = F(n)+2^n. 1
4, 7, 21, 265, 65553, 4294967329, 18446744073709551681, 340282366920938463463374607431768211585, 115792089237316195423570985008687907853269984665640564039457584007913129640193 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

EXAMPLE

F(1) = 2^(2^1)+1 = 5

M(1) = 2^1-1 = 1

F(1)+M(2)+1 = 7

MATHEMATICA

Table[2^(2^n)+2^n+1, {n, 0, 10}] (* Harvey P. Dale, Jun 24 2011 *)

PROG

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

CROSSREFS

Sequence in context: A320663 A186335 A010363 * A228015 A145931 A026548

Adjacent sequences:  A119558 A119559 A119560 * A119562 A119563 A119564

KEYWORD

nonn

AUTHOR

Cino Hilliard, May 31 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 8 07:16 EDT 2020. Contains 335513 sequences. (Running on oeis4.)