cp's OEIS Frontend

A119562 Let 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 + 3.

%I A119562 #6 Oct 01 2013 17:58:25
%S A119562 4,5,15,251,65523,4294967267,18446744073709551555,
%T A119562 340282366920938463463374607431768211331,
%U A119562 115792089237316195423570985008687907853269984665640564039457584007913129639683
%N A119562 Let 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 + 3.
%F A119562 a(n) = A001146(n)-A000079(n)+3 = A119564(n)+2. - _R. J. Mathar_, May 15 2007
%e A119562 F(1) = 2^(2^1)+1 = 5
%e A119562 M(1) = 2^1-1 = 1
%e A119562 F(1) - M(2) + 1 = 5
%o A119562 (PARI) fm2(n) = for(x=0,n,y=2^(2^x)-2^x+3;print1(y","))
%K A119562 nonn
%O A119562 0,1
%A A119562 _Cino Hilliard_, May 31 2006
%E A119562 Definition corrected by _R. J. Mathar_, May 15 2007