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.

A339545 Primes p such that A007088(p) == A151799(p) (mod p).

This page as a plain text file.
%I A339545 #11 Feb 04 2024 14:14:31
%S A339545 3,19,29,691
%N A339545 Primes p such that A007088(p) == A151799(p) (mod p).
%C A339545 Primes p such that the binary representation of p, considered as a decimal number, is congruent mod p to the prime previous to p.
%C A339545 No other terms < 10^11. - _Max Alekseyev_, Feb 04 2024
%e A339545 a(3) = 29 is a member because 29 = 11101_2, 11101 == 23 (mod 29), and 23 is the prime previous to 29.
%p A339545 select(t -> isprime(t) and convert(t,binary) mod t = prevprime(t), [seq(i,i=3..1000,2)]);
%Y A339545 Cf. A007088, A151799, A339544.
%K A339545 nonn,base,more
%O A339545 1,1
%A A339545 _J. M. Bergot_ and _Robert Israel_, Dec 08 2020