This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070969 a(n) = 2^(2^n + 1) + 1. 4
 5, 9, 33, 513, 131073, 8589934593, 36893488147419103233, 680564733841876926926749214863536422913, 231584178474632390847141970017375815706539969331281128078915168015826259279873 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..13 EXAMPLE a(0)=5 because 2^(2^0 + 1) + 1 = 2^(1 + 1) + 1 = 2^2 + 1 = 4 + 1 = 5. MATHEMATICA 2^(2^Range[0, 9] + 1) + 1 (* Vladimir Joseph Stephan Orlovsky, Jun 22 2011 *) PROG (MAGMA) [(2^((2^n)+1))+1: n in [0..8]]; // Vincenzo Librandi, Jun 20 2011 (PARI) a(n)=1<<(2^n+1)+1 \\ Charles R Greathouse IV, Jul 30 2011 (Maxima) A070969(n):=(2^(2^n+1))+1\$ makelist(A070969(n), n, 0, 10); /* Martin Ettl, Dec 10 2012 */ CROSSREFS Cf. A000215, A077585. Sequence in context: A098640 A239546 A083832 * A200376 A098477 A243762 Adjacent sequences:  A070966 A070967 A070968 * A070970 A070971 A070972 KEYWORD nonn AUTHOR Anon, May 17 2002 EXTENSIONS Edited by Robert G. Wilson v, May 20 2002 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.

Last modified December 13 17:17 EST 2019. Contains 329970 sequences. (Running on oeis4.)