Using Walnut to solve problems from the OEIS
Number Theory
2025-03-07 v1 Combinatorics
Abstract
We use the automatic theorem prover Walnut to resolve various open problems from the OEIS 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 subsumfree sequences A026471 and A026475. Our findings also give rise to new open problems.
Cite
@article{arxiv.2503.04122,
title = {Using Walnut to solve problems from the OEIS},
author = {Wieb Bosma and Rene Bruin and Robbert Fokkink and Jonathan Grube and Anniek Reuijl and Thian Tromp},
journal= {arXiv preprint arXiv:2503.04122},
year = {2025}
}