For every r≥3, a_r(r)=G(r−1).
Status is community- and machine-tracked and may lag. Verify independently before investing effort.
Statement
For every r≥3, a_r(r)=G(r−1). Open residue: Verified for all r≤200.
Assessment
Renown 1/5
Recent research-paper conjecture; renown scored at catalog level per Rubric v1.
Attackability 5/5
The identity has been checked through r=200; the recurrence is deterministic and a counterexample is a single integer mismatch.
- finite witness
- 4/5
- oracle cost
- 5/5
- freshness
- 5/5
- seedability
- 5/5
Verification note
Generate both sequences exactly with independent implementations and compare; preserve derivation traces. — 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.