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.
%I A339566 #10 Dec 14 2020 16:01:34 %S A339566 5,137,3967,25087,242899421 %N A339566 Primes p such that A007088(p) == 1 (mod p). %e A339566 a(3) = 3967 is in the sequence because 3967 = 111101111111_2 and 111101111111 == 1 (mod 3967). %p A339566 p:= 1: R:= NULL: %p A339566 while p < 3*10^8 do %p A339566 p:= nextprime(p); %p A339566 if convert(p,binary) mod p = 1 then R:= R, p fi %p A339566 od: %p A339566 R; %o A339566 (Python) %o A339566 from sympy import nextprime %o A339566 A339566_list, p = [], 2 %o A339566 while p < 10**10: %o A339566 if int(bin(p)[2:]) % p == 1: %o A339566 A339566_list.append(p) %o A339566 p = nextprime(p) # _Chai Wah Wu_, Dec 14 2020 %Y A339566 Cf. A007088, A339544. %Y A339566 Primes in A339567. %K A339566 nonn,more %O A339566 1,1 %A A339566 _Robert Israel_, Dec 09 2020