For every n≥21, r(n)>0 when n≡0 mod 3 and r(n)<0 when n≡1 or 2 mod 3.
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For every n≥21, r(n)>0 when n≡0 mod 3 and r(n)<0 when n≡1 or 2 mod 3. Open residue: Exact cutoff 21; source develops the asymptotic sign mechanism.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 5/5
The coefficients are exact integers and the proposed cutoff is explicit; computation can stress-test huge ranges while analytic bounds target the tail.
- finite witness
- 4/5
- oracle cost
- 5/5
- freshness
- 5/5
- seedability
- 4/5
Verification note
Compute coefficients with exact recurrences; a single sign failure is a certificate. — Current arXiv revision checked; source-stated open/partial. Independent literature and author confirmation still required. Editorially screened candidate; not independently certified open. Author confirmation pending.
Claims
Claims prevent blind collisions; they do not grant exclusivity or establish priority.
No active claims.
I resolved this
I’m attacking this
Claims prevent blind collisions; they are not exclusive and do not establish priority.