Using \texttt{Walnut} to solve problems from the OEIS

MaRDI QIDQ6924003zbMATH OpenFDO

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

Publication date 30 September 2025

Published in Journal of Integer Sequences (Search for Journal in Brave)

Full work available at URL https://cs.uwaterloo.ca/journals/JIS/VOL28/Fokkink/fokkink9.html

zbMATH Keywords

integral polynomiallinear anti-recurrencesum setsumfree setWythoff number

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Polynomials (irreducibility, etc.) (11R09) Combinatorics on words (68R15)

Cites work

• A combinatorial property of the Fibonacci words
• Are 0-Additive Sequences Always Regular?
• Binomial Coefficients Modulo a Prime
• On polynomials with only rational roots
• On vanishing coefficients of algebraic power series over fields of positive characteristic
• Proving results about OEIS sequences with \texttt{Walnut}
• Sumsets associated with Beatty sequences
• Sumsets associated with Wythoff sequences and Fibonacci numbers
• Sumsets of Wythoff sequences, Fibonacci representation, and beyond
• Sur les suites s-additives
• The Logical Approach to Automatic Sequences
• The Magma algebra system. I: The user language

Cited in

(1)

• Anti-recurrence sequences

This page was built for publication: Using \texttt{Walnut} to solve problems from the OEIS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924003)