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.

A355963 Primes p such that (p+8)^(p-1) == 1 (mod p^2).

Original entry on oeis.org

1531, 7445287
Offset: 1

Views

Author

Felix Fröhlich, Jul 21 2022

Keywords

Comments

a(3) > 34294200797 if it exists.

Crossrefs

(p+k)^(p-1) == 1 (mod p^2): A355959 (k=2), A355960 (k=5), A355961 (k=6), A355962 (k=7), A355964 (k=9), A355965 (k=10).

Programs

  • PARI
    forprime(p=1, , if(Mod(p+8, p^2)^(p-1)==1, print1(p, ", ")))

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

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