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))).

This page as a plain text file.
%I A357364 #4 Oct 01 2022 19:35:28
%S A357364 11,23,41,107,389,1987673,35603983
%N 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))).
%o A357364 (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
%o A357364 forprime(p=7, , if(is(p), print1(p, ", ")))
%Y A357364 Cf. A151800, A357362, A357363, A357365.
%K A357364 nonn,hard,more
%O A357364 1,1
%A A357364 _Felix Fröhlich_, Sep 25 2022

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

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