Using Walnut to Solve Problems from the OEIS
Wieb Bosma
Radboud University Nijmegen
Department of Mathematics
Heyendaalseweg 135
6525 AJ
The Netherlands
René Bruin
University Utrecht
Mathematisch Instituut
Budapestlaan 6
3584 CD
The Netherlands
Robbert Fokkink
Technical University Delft
Faculty of Mathematics
Mekelweg 4
2628 CD
The Netherlands
Jonathan Grube, Anniek Reuijl, and Thian Tromp
University Utrecht
Mathematisch Instituut
Budapestlaan 6
3584 CD
The Netherlands
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.
Full version: pdf,
dvi,
ps,
latex,
Walnut code and automata
(Concerned with sequences
A026471
A026475
A075326
A249031
A260311
A260317
A265389
A290409
A297464
A297465
A297466
A299409.)
Received March 12 2025; revised versions received May 4 2025; July 16 2025.
Published in Journal of Integer Sequences,
July 19 2025.
Return to
Journal of Integer Sequences home page