login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A261071 a(n) = 2^(n!) + 1. 0

%I #21 Sep 08 2022 08:46:13

%S 3,5,65,16777217,1329227995784915872903807060280344577

%N a(n) = 2^(n!) + 1.

%C a(n) is a sum of two k-th powers of positive integers for k=1,2,...,n.

%F a(n) = 2^(n!) + 1.

%F a(n) = A050923(n) + 1.

%e a(3) = 2^6 + 1 = 65.

%o (PARI) first(m)=vector(m,i,2^(i!)+1); /* _Anders Hellström_, Aug 08 2015 */

%o (Magma) [2^(Factorial(n)) + 1: n in [1..6]]; // _Vincenzo Librandi_, Aug 09 2015

%Y Cf. A050923.

%K nonn,easy

%O 1,1

%A _Marco RipĂ _, Aug 08 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 4 22:13 EDT 2023. Contains 365888 sequences. (Running on oeis4.)