OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..61 from Daniel Lignon)
MATHEMATICA
eulerPseudoQ[n_?PrimeQ, b_] = False; eulerPseudoQ[n_, b_] := Block[{p = PowerMod[b, (n - 1)/2, n]}, p == Mod[1, n] || p == Mod[-1, n]]; Select[2 Range[25000] + 1, eulerPseudoQ[#, 7] &] (* Michael De Vlieger, Sep 09 2015, after Jean-François Alcover at A006970 *)
PROG
(PARI) for(n=1, 1e5, if( Mod(7, (2*n+1))^n == 1 || Mod(7, (2*n+1))^n == 2*n && bigomega(2*n+1) != 1 , print1(2*n+1", "))); \\ Altug Alkan, Oct 11 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Daniel Lignon, Sep 09 2015
STATUS
approved