Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #34 Apr 21 2024 19:21:35
%S 5,11,23,71,101,263,503,1031,1283,1487,1511,1583,1637,2039,2087,2543,
%T 2843,2903,3023,5039,5519,5927,7823,9851,10589,10859,12101,12107,
%U 13103,15647,18719,18749,19157,20543,22679,23459,25463,26183,26687,26723,27791,29759,30341
%N Primes p such that A276173(p) = p.
%C These terms are the primes for which A030187(p) == 0 (mod p).
%C These terms are the primes prime(A276193(n)) for which A276193(n) = 0.
%H Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/A276174.py">Python program</a>.
%e 5 = A276173(3) = prime(3),
%e 11 = A276173(5) = prime(5),
%e 23 = A276173(9) = prime(9),
%e 71 = A276173(20) = prime(20).
%Y Cf. A030187, A276173, A276193.
%K nonn
%O 1,1
%A _Seiichi Manyama_, Sep 10 2016
%E a(25)-a(43) from _Lucas A. Brown_, Apr 21 2024