[seqfan] Fermat modulo Mersenne

[Tomasz Ordowski]

Dear SeqFans!

Let a(n) = F(n) mod M(n), where F(n) = 2^(2^n)+1 and M(n) = 2^n-1, for n>0.

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,...

FORMULA: For n > 1, a(n) = 2^(2^n mod n) + 1.

It contains all Fermat numbers > 3.

The sequence is not in OEIS.

Thomas
___________________________
For n > 1, a(n) = A112987(n) + 1.
See: https://oeis.org/A112987
(an error in the formula).



<#m_-1368170884994049100_m_8852906643069678228_DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>