On digital sequences associated with Pascal's triangle

DOI10.1007/S00010-022-00932-ZMaRDI QIDQ6388492arXivFDO

Authors Pierre Mathonet, Michel Rigo, Manon Stipulanti, Naïm Zenaïdi

Publication date 17 January 2022

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00010-022-00932-Z

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Radix representation; digital problems (11A63) Binomial coefficients; factorials; (q)-identities (11B65) Automata sequences (11B85) Formal languages and automata (68Q45) Combinatorics on words (68R15)

arXiv classification

cs.DMcs.FLmath.COmath.NT

Abstract: We consider the sequence of integers whose $n$th term has base-$p$ expansion given by the $n$th row of Pascal's triangle modulo $p$ (where $p$ is a prime number). We first present and generalize well-known relations concerning this sequence. Then, with the great help of Sloane's On-Line Encyclopedia of Integer Sequences, we show that it appears naturally as a subsequence of a $2$-regular sequence. Its study provides interesting relations and surprisingly involves odious and evil numbers, Nim-sum and even Gray codes. Furthermore, we examine similar sequences emerging from prime numbers involving alternating sum-of-digits modulo~$p$. This note ends with a discussion about Pascal's pyramid involving trinomial coefficients.

This page was built for publication: On digital sequences associated with Pascal's triangle

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