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.

A339181 Primes p such that p == 1 (mod A001414(p-1)) and p == 1 (mod A001414(p+1)).

Original entry on oeis.org

17, 31, 151, 241, 577, 3001, 3571, 4801, 12097, 21121, 23761, 28513, 61441, 65521, 77761, 113023, 126001, 171697, 174721, 178753, 193441, 244901, 287281, 364801, 582427, 616897, 677321, 976501, 1016401, 1425601, 1431847, 2015441, 2080801, 2483713, 2672671, 3089371, 4321931, 4667921, 5177761
Offset: 1

Views

Author

J. M. Bergot and Robert Israel, Nov 26 2020

Keywords

Comments

Members p of A339180 such that p == 1 (mod A001414(p-1)).

Examples

			a(3) = 151 is in the sequence because 151 is prime, A001414(150)=2+3+5+5=15, A001414(152)=2+2+2+19=25, 151 == 1 (mod 15) and 151 == 1 (mod 25).
		

Crossrefs

Programs

  • Maple
    spf:= n -> add(t[1]*t[2], t=ifactors(n)[2]):
    select(p -> isprime(p) and p mod spf(p-1) = 1 and p mod spf(p+1) = 1, [seq(i, i=3..6*10^6, 2)]);