OFFSET
1,2
COMMENTS
From Shreyansh Jaiswal, Jun 14 2025: (Start)
If the density of the set containing all even terms exists, then it is less than 0.15. (Proposition 3 in Jaiswal.)
Let k denote any even term. Then, the least prime factor of k+1 is either 3 or 5. (Theorem 11 in Jaiswal.)
Each even term satisfies at least one of three specific congruences. (Theorem 2 in Jaiswal.)
10519952096 and 16159802432 are also terms of this sequence.
Conjecture: There are infinitely many terms of this sequence. (Conjecture 15 in Jaiswal.) (End)
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..89 (terms below 10^10)
Shreyansh Jaiswal, On the Even Solutions of A071324(n) = A071324(n+1), Jun 14, 2025.
EXAMPLE
MATHEMATICA
f[n_] := Plus @@ (-(d = Divisors[n])*(-1)^(Range[Length[d], 1, -1])); seq = {}; f1 = f[1]; Do[f2 = f[n]; If[f1 == f2, AppendTo[seq, n-1]]; f1 = f2, {n, 2, 50000}]; seq
SequencePosition[Table[Total[Times@@@Partition[Riffle[Reverse[Divisors[n]], {1, -1}, {2, -1, 2}], 2]], {n, 2565*10^4}], {x_, x_}][[All, 1]] (* Harvey P. Dale, Nov 06 2022 *)
PROG
(Python)
from sympy import divisors; from functools import lru_cache
cached_divisors = lru_cache()(divisors)
def c(n): return sum(d if i%2==0 else -d for i, d in enumerate(reversed(cached_divisors(n))))
for n in range(1, 2201):
if c(n) == c(n+1):
print(n, end=", ") # Shreyansh Jaiswal, Apr 14 2025
CROSSREFS
KEYWORD
nonn,hard
AUTHOR
Amiram Eldar, Mar 13 2020
STATUS
approved
