Using Walnut to Solve Problems from the OEIS

Wieb Bosma, Jonathan Grube, René Bruin, Anniek Reuijl, Robbert Fokkink*, Thian Tromp

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

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.

Original languageEnglish
Article number25.3.8
Number of pages21
JournalJournal of Integer Sequences
Volume28
Issue number3
Publication statusPublished - 2025

Keywords

  • integral polynomial
  • linear anti-recurrence
  • sum set
  • sumfree set
  • Wythoff number

Fingerprint

Dive into the research topics of 'Using Walnut to Solve Problems from the OEIS'. Together they form a unique fingerprint.

Cite this