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.

A355964 Primes p such that (p+9)^(p-1) == 1 (mod p^2).

Original entry on oeis.org

13, 19, 2207, 26041, 332698495781
Offset: 1

Views

Author

Felix Fröhlich, Jul 21 2022

Keywords

Comments

a(6) > 10^13 if it exists. - Jason Yuen, May 12 2024

Crossrefs

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

Programs

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

Extensions

a(5) from Jason Yuen, May 12 2024