cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A123591 a(n) = ((2^n - 1)^(2^n) - 1)/(2^n)^2.

Original entry on oeis.org

-1, 0, 5, 90075, 25657845139503479, 516742576223066713590751888575037849059948015
Offset: 0

Views

Author

Alexander Adamchuk, Nov 13 2006

Keywords

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

Crossrefs

Cf. A085606 (n-1)^n - 1.
Cf. A127643.

Programs

  • Magma
    [((2^n - 1)^(2^n) - 1)/(2^n)^2: n in [0..7]]; // G. C. Greubel, Oct 26 2017
  • Mathematica
    Table[((2^n-1)^(2^n)-1)/(2^n)^2,{n,0,7}]
  • PARI
    for(n=0,7, print1(((2^n - 1)^(2^n) - 1)/(2^n)^2, ", ")) \\ G. C. Greubel, Oct 26 2017
    

Formula

a(n) = ((2^n - 1)^(2^n) - 1)/(2^n)^2.
a(n) = A085606(2^n)/(2^n)^2.

Extensions

More terms from Alexander Adamchuk, Jan 22 2007
Showing 1-1 of 1 results.