|
|
A339566
|
|
Primes p such that A007088(p) == 1 (mod p).
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 3967 is in the sequence because 3967 = 111101111111_2 and 111101111111 == 1 (mod 3967).
|
|
MAPLE
|
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;
|
|
PROG
|
(Python)
from sympy import nextprime
while p < 10**10:
if int(bin(p)[2:]) % p == 1:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|