A339544 -id:A339544 - cp's OEIS frontend

A339566 Primes p such that A007088(p) == 1 (mod p).

5, 137, 3967, 25087, 242899421

Offset: 1

Robert Israel, Dec 09 2020

			a(3) = 3967 is in the sequence because 3967 = 111101111111_2 and 111101111111 == 1 (mod 3967).

Cf. A007088, A339544.

Primes in A339567.

p:= 1: R:= NULL:
while p < 3*10^8 do
p:= nextprime(p);
if convert(p,binary) mod p = 1 then R:= R, p fi
od:
R;

from sympy import nextprime
A339566_list, p = [], 2
while p < 10**10:
    if int(bin(p)[2:]) % p == 1:
        A339566_list.append(p)
    p = nextprime(p) # Chai Wah Wu, Dec 14 2020

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

Original entry on oeis.org

3, 19, 29, 691

Offset: 1

J. M. Bergot and Robert Israel, Dec 08 2020

Primes p such that the binary representation of p, considered as a decimal number, is congruent mod p to the prime previous to p.

No other terms < 10^11. - Max Alekseyev, Feb 04 2024

			a(3) = 29 is a member because 29 = 11101_2, 11101 == 23 (mod 29), and 23 is the prime previous to 29.

Cf. A007088, A151799, A339544.

select(t -> isprime(t) and convert(t,binary) mod t = prevprime(t), [seq(i,i=3..1000,2)]);

cp's OEIS Frontend

A339566 Primes p such that A007088(p) == 1 (mod p).

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Python