OFFSET
1,1
COMMENTS
Computed terms are prime. Is it always the case? If not it would be interesting to compute the pseudoprimes.
Conjecture: a(n) == 1 mod 162 for n >= 6. The next few larger terms of the form 162*k+1 are: 44165935747, 46696027123, 85683674179, 88567070707, 101297654083, 131264938963, 131315541283, 177876176419, 195689448883, 196838306227, 213339588643, 310256425603, 378897238243, 502106519683, 588454831747, 611537689459, 641551809187, 735075731107, 745956214867, 755236606483, 771153067603, 872146803043 (and they are all primes). - Chai Wah Wu, Oct 06 2020
MATHEMATICA
Select[Range[3, 400000, 2], PowerMod[2, (# - 1)/2, (t = #*(# - 1)/2)] == t - 1 &] (* Amiram Eldar, Sep 23 2020 *)
PROG
(PARI) is(n) = n%2 && n>=3 && Mod(2, n*(n-1)/2)^((n-1)/2) == -1 \\ David A. Corneth, Sep 23 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Sep 23 2020
EXTENSIONS
a(7)-a(27) from Amiram Eldar, Sep 23 2020
STATUS
approved