Amiram Eldar, <a href="/A262054/b262054_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..61 from Daniel Lignon)
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
Amiram Eldar, <a href="/A262054/b262054_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..61 from Daniel Lignon)
reviewed
approved
proposed
reviewed
editing
proposed
Amiram Eldar, <a href="/A262054/b262054_1.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..61 from Daniel Lignon)
Daniel Lignon, Amiram Eldar, <a href="/A262054/b262054_1.txt">Table of n, a(n) for n = 1..6110000</a>
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
(PARI) for(n=1, 1e5, if ( Mod(7^n % , (2*n+1) )^n == 1 || Mod(7^n % , (2*n+1) )^n == 2*n && bigomega(2*n+1) != 1 , print1(2*n+1", "))); \\ Altug Alkan, Oct 01 11 2015
proposed
editing