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.

A357364 Primes p such that either p^(q-1) == 1 (mod q^2) or q^(p-1) == 1 (mod p^2), where q = A151800(A151800(A151800(p))).

Original entry on oeis.org

11, 23, 41, 107, 389, 1987673, 35603983
Offset: 1

Views

Author

Felix Fröhlich, Sep 25 2022

Keywords

Crossrefs

Programs

  • PARI
    is(n) = my(b=precprime(precprime(precprime(n-1)-1)-1)); Mod(b, n^2)^(n-1)==1 || Mod(n, b^2)^(b-1)==1
    forprime(p=7, , if(is(p), print1(p, ", ")))