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.

A242982 Primes p such that p^2 divides 20^(p-1) - 1.

Original entry on oeis.org

281, 46457, 9377747, 122959073
Offset: 1

Views

Author

Felix Fröhlich, May 28 2014

Keywords

Comments

Base 20 Wieferich primes. According to Richard Fischer, there is no other term up to approximately 5*10^13.

Crossrefs

Programs

  • Mathematica
    Select[Prime[Range[1000000]], PowerMod[20, # - 1, #^2] == 1 &] (* Robert Price, May 17 2019 *)
  • PARI
    forprime(n=2, 10^9, if(Mod(20, n^2)^(n-1)==1, print1(n, ", ")));