|
|
A329706
|
|
Odd numbers k such that Sum_{j=1..(k-1)/2, gcd(j,k)=1} 1/j == -2*q_2(k) + k*q_2(k)^2 (mod k^3), where q_2(k) = (2^phi(k) - 1)/k is the Euler quotient of k to base 2.
|
|
0
|
|
|
1, 3, 597, 609, 1791, 2035, 3403, 3701, 4263, 27515, 27955
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Emma Lehmer proved that Sum_{j=1..(p-1)/2} 1/j == -2*q_2(p) + p*q_2(p)^2 (mod p^2) for all odd primes p.
Tianxin Cai generalized Lehmer's congruence and proved that Sum_{j=1..(k-1)/2, gcd(j,k)=1} 1/j == -2*q_2(k) + k*q_2(k)^2 (mod k^2) for all odd numbers k.
This sequence includes the odd numbers k for which the congruence is still valid when (mod k^2) is being replaced with (mod k^3).
The prime terms are 3, 3701, ...
No more terms below 147000.
|
|
LINKS
|
|
|
MATHEMATICA
|
q[n_] := (2^EulerPhi[n] - 1)/n; Select[Range[1, 2100, 2], Divisible[Numerator[Sum[Boole @ CoprimeQ[j, #]/j, {j, 1, (# - 1)/2}] + 2*q[#] - #*q[#]^2], #^3] &]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|