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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A321577 a(n) = F_n mod M_n, where F_n = 2^(2^n) + 1 and M_n = 2^n - 1. 1
 0, 2, 5, 2, 5, 17, 5, 2, 257, 17, 5, 17, 5, 17, 257, 2, 5, 1025, 5, 65537, 257, 17, 5, 65537, 129, 17, 67108865, 65537, 5, 17, 5, 2, 257, 17, 262145, 268435457, 5, 17, 257, 65537, 5, 4194305, 5, 65537, 131073, 17, 5, 65537, 1073741825, 16777217, 257, 65537, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Sequence contains all Fermat numbers > 3. LINKS FORMULA For n > 1, a(n) = 2^(2^n mod n) + 1 = A112987(n) + 1. MATHEMATICA Prepend[1 + 2^Array[PowerMod[2, #, #] &, 85, 2], 0] (* Michael De Vlieger, Nov 13 2018, after Vincenzo Librandi at A112987 *) PROG (PARI) apply( A321577(n)=if(n>1, 2^lift(Mod(2, n+!n)^n)+1), [0..50]) \\ M. F. Hasler, Nov 19 2018 CROSSREFS Cf. A000215, A000225, A112987. Sequence in context: A151572 A166376 A089122 * A268789 A269920 A240706 Adjacent sequences:  A321574 A321575 A321576 * A321578 A321579 A321580 KEYWORD nonn AUTHOR Thomas Ordowski, Nov 13 2018 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 June 1 02:09 EDT 2020. Contains 334758 sequences. (Running on oeis4.)