On digital sequences associated with Pascal's triangle
DOI10.1007/s00010-022-00932-zOpenAlexW4311779308MaRDI QIDQ2696006
Manon Stipulanti, Naïm Zenaïdi, Pierre Mathonet, Michel Rigo
Publication date: 5 April 2023
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.06636
automatic sequencespolynomial identitiesbinomial coefficientsregular sequencesFermat primesevil numbersodious numbersPascal's triangledigital sequencesinteger numeration systems
Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65) Combinatorics on words (68R15) Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Automata sequences (11B85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Beyond odious and evil
- Generalized Pascal triangle for binomial coefficients of words
- Pascal's triangle, complexity and automata
- Logic and \(p\)-recognizable sets of integers
- Linear cellular automata, finite automata and Pascal's triangle
- On synchronized sequences and their separators
- Geometry of Binomial Coefficients
- Automatic Sequences
- On Stephan's conjectures concerning Pascal triangle modulo 2
- A Mixing of Prouhet-Thue-Morse Sequences and Rademacher Functions
- Binomial Coefficients Modulo a Prime
- 17 lectures on Fermat numbers. From number theory to geometry. With a foreword by Alena Šolcová
This page was built for publication: On digital sequences associated with Pascal's triangle
