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.

A280150 Primes p such that 68^(p-1) == 1 (mod p^2).

Original entry on oeis.org

5, 7, 19, 113, 2741
Offset: 1

Views

Author

Thomas Ordowski, Dec 27 2016

Keywords

Comments

For p = 5 and 113 is 68^(p-1) == 1 (mod p^3).
No further terms up to 7.74*10^13 (cf. Fischer link). - Felix Fröhlich, Dec 27 2016

Links

Crossrefs

Cf. A001220, A273085.

Programs

  • Mathematica
    Select[Prime[Range[500]],PowerMod[68,#-1,#^2]==1&] (* Harvey P. Dale, Aug 07 2019 *)
  • PARI
    forprime(p=1, , if(Mod(68, p^2)^(p-1)==1, print1(p, ", "))) \\ Felix Fröhlich, Dec 27 2016

Extensions

a(5) from Felix Fröhlich, Dec 27 2016
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.