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!)
A261071 a(n) = 2^(n!) + 1. 0
3, 5, 65, 16777217, 1329227995784915872903807060280344577 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

Table of n, a(n) for n=1..5.

FORMULA

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

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

EXAMPLE

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

PROG

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

(MAGMA) [2^(Factorial(n)) + 1: n in [1..6]]; // Vincenzo Librandi, Aug 09 2015

CROSSREFS

Cf. A050923.

Sequence in context: A318546 A076513 A222611 * A247862 A145616 A306255

Adjacent sequences:  A261068 A261069 A261070 * A261072 A261073 A261074

KEYWORD

nonn,easy

AUTHOR

Marco Ripà, Aug 08 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 08:05 EDT 2021. Contains 347556 sequences. (Running on oeis4.)