login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085603 (2n)^(2n) + 1. 0
2, 5, 257, 46657, 16777217, 10000000001, 8916100448257, 11112006825558017, 18446744073709551617, 39346408075296537575425, 104857600000000000000000001 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

a(n) is never a perfect square because (2n)^(2n) is a positive square and the only squares that differ by 1 are 0 and 1. Sierpinski numbers are n^n+1. Hence this sequence is a subset of the Sierpinski numbers (A014566). - T. D. Noe, Mar 31 2006

LINKS

Table of n, a(n) for n=0..10.

PROG

(PARI) forstep(x=0, 20, 2, print1(x^x+1" "))

CROSSREFS

Sequence in context: A137066 A175977 A121270 * A309675 A042341 A300900

Adjacent sequences:  A085600 A085601 A085602 * A085604 A085605 A085606

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard, Jul 07 2003

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 October 16 05:23 EDT 2019. Contains 328043 sequences. (Running on oeis4.)