OFFSET
1,2
FORMULA
2^a(n) == 3 (mod A001915(n)), where a(n) >= 0 and minimum possible.
PROG
(Magma) lst:=[0]; for p in [5..647 by 2] do if IsPrime(p) then e:=Ceiling(Log(2, p+1)); for x in [e..p-2] do if 2^x mod p eq 3 then Append(~lst, x); break; end if; end for; end if; end for; lst; // Arkadiusz Wesolowski, Jan 12 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Max Alekseyev, Jan 14 2007
EXTENSIONS
Corrected by Max Alekseyev, Jun 08 2011
Corrected by Arkadiusz Wesolowski, Jan 12 2021
STATUS
approved