The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A123591 a(n) = ((2^n - 1)^(2^n) - 1)/(2^n)^2. 2
-1, 0, 5, 90075, 25657845139503479, 516742576223066713590751888575037849059948015 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
The next term is too large to include.
Last digit of a(n) is 5 or 9 for n>1. It appears that a(4k) == 4 mod 5 and a(4k+1) == a(4k+2) == a(4k+3) == 0 mod 5.
p divides a(p) for prime p>2. Composite numbers n such that n divides a(n) are listed in A127643 = {15,51,65,85,185,221,255,341,451,533,561,595,645,679,771,...}. - Alexander Adamchuk, Jan 22 2007
LINKS
FORMULA
a(n) = ((2^n - 1)^(2^n) - 1)/(2^n)^2.
a(n) = A085606(2^n)/(2^n)^2.
MATHEMATICA
Table[((2^n-1)^(2^n)-1)/(2^n)^2, {n, 0, 7}]
PROG
(PARI) for(n=0, 7, print1(((2^n - 1)^(2^n) - 1)/(2^n)^2, ", ")) \\ G. C. Greubel, Oct 26 2017
(Magma) [((2^n - 1)^(2^n) - 1)/(2^n)^2: n in [0..7]]; // G. C. Greubel, Oct 26 2017
CROSSREFS
Cf. A085606 (n-1)^n - 1.
Cf. A127643.
Sequence in context: A171981 A145232 A263174 * A133381 A366270 A236066
KEYWORD
sign
AUTHOR
Alexander Adamchuk, Nov 13 2006
EXTENSIONS
More terms from Alexander Adamchuk, Jan 22 2007
STATUS
approved

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 May 21 11:30 EDT 2024. Contains 372736 sequences. (Running on oeis4.)