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!)
A321577 a(n) = F_n mod M_n, where F_n = 2^(2^n) + 1 and M_n = 2^n - 1. 1

%I

%S 0,2,5,2,5,17,5,2,257,17,5,17,5,17,257,2,5,1025,5,65537,257,17,5,

%T 65537,129,17,67108865,65537,5,17,5,2,257,17,262145,268435457,5,17,

%U 257,65537,5,4194305,5,65537,131073,17,5,65537,1073741825,16777217,257,65537,5

%N a(n) = F_n mod M_n, where F_n = 2^(2^n) + 1 and M_n = 2^n - 1.

%C Sequence contains all Fermat numbers > 3.

%F For n > 1, a(n) = 2^(2^n mod n) + 1 = A112987(n) + 1.

%t Prepend[1 + 2^Array[PowerMod[2, #, #] &, 85, 2], 0] (* _Michael De Vlieger_, Nov 13 2018, after _Vincenzo Librandi_ at A112987 *)

%o (PARI) apply( A321577(n)=if(n>1,2^lift(Mod(2, n+!n)^n)+1), [0..50]) \\ _M. F. Hasler_, Nov 19 2018

%Y Cf. A000215, A000225, A112987.

%K nonn

%O 1,2

%A _Thomas Ordowski_, Nov 13 2018

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 5 07:06 EDT 2020. Contains 335460 sequences. (Running on oeis4.)