The periodic characterization of the greedy 3-subsumfree sequence S_{1,2,3}
The periodic characterization of the greedy 3-subsumfree sequence S_{1,2,3}
Let be the greedy 3-subsumfree sequence beginning with : after the initial values, each term is the smallest larger integer that is not the sum of three distinct previous terms. The periodic characterization conjecture. For every positive integer ,
The paper reports that Walnut verifies this statement, so it is subsequently promoted to a theorem.
Sources & referencesView supporting material
Primary source
Wieb Bosma, Rene Bruin, Robbert Fokkink, Jonathan Grube, Anniek Reuijl and Thian Tromp, “Using Walnut to solve problems from the OEIS”, arXiv:2503.04122 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.