Benoit Cloitre

works on

asymptotic analysis 1 combinatorics 1 Dyck paths 1 integer sequences 1 recurrence relations 1

From the 1 of 15 linked papers with an AI index.

collaborators

Showing math.NTShow all

12 papers · 1 filter

math.NT2026

Fibonacci, Dirichlet, and Gauss in a single sum

Benoit Cloitre

We study the fractional-part sums $\sum_{k = 1}^{n} {F_{n} / F_{k}}$ , where $F_{n}$ is the $n$ th Fibonacci number. Their asymptotic behavior depends on the parity of $n$ . For odd $n$ , the r…

math.NT2026

The Mantovanelli-Hofstadter Sequence

Benoit Cloitre

The paper analyzes a perturbed Hofstadter recurrence introduced by Mantovanelli, proving it is well-defined for all positive integers and determining its asymptotic growth as n/2 w…

math.NT2026

The Thue-Morse Transform

Benoit Cloitre

We define the Thue-Morse transform T on a class of infinite binary words. It sends the alternating word a_0 = 010101... to the Thue-Morse sequence. We then study its orbit a_m = T^…

math.NT2026

Meta-automatic Sequences

John M. Campbell, Benoit Cloitre

Nested (or meta-Fibonacci) recurrences, such as the recurrence used to define Hofstadter's Q-sequence, along with the digit-based recurrences that underlie automatic sequences are…

math.NT2026

Beatty solutions of almost Golomb functional equations

Benoit Cloitre

We study the almost Golomb equation of order $r$ , $a (S (n)) = n$ , where $S (n) = a (n) + a (n - 1) + \dots + a (n - r + 1)$ , for nondecreasing sequences of positive integers. Its greedy solu…

math.NT2026

Primes in LCM recurrences

Benoit Cloitre

We study an LCM-based analogue of Rowland's GCD-based prime-generating recurrence, introduced by the author in 2008. The multiplicative increments of this sequence are conjectured…