Using Walnut to Solve Problems from the OEIS
Wieb Bosma (Radboud Universiteit Nijmegen)
Jonathan Grube (Universiteit Utrecht)
René Bruin (Universiteit Utrecht)
Anniek Reuijl (Universiteit Utrecht)
Robbert Fokkink (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Thian Tromp (Universiteit Utrecht)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We use the automatic theorem prover Walnut to resolve various open problems from the OEIS (On-Line Encyclopedia of Integer Sequences) and beyond. Specifically, we clarify the structure of sequence A260311, which concerns runs of sums of upper Wythoff numbers. We extend a result of Hajdu, Tijdeman, and Varga on polynomials with nonzero coefficients modulo a prime. Additionally, we settle open problems related to the anti-recurrence sequences A265389 and A299409, as well as the sumfree sequences A026471 and A026475. Our findings also give rise to new open problems.