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^m(a_0) as well as the sequences u_m and v_m giving…
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 of interest from both number-theoretic and combinatorial…
The almost Golomb equation of order $r$ is the implicit functional equation $$a\Bigl(\sum_{j=0}^{r-1} a(n{-}j)\Bigr) = n$$ for nondecreasing sequences of positive integers with $a(1)=1$. Its earliest solution, the almost Golomb sequence of…
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 always to be $1$ or prime, but a complete proof requires a…
The Hofstadter Q-sequence is a prominent example of nested recurrence. Despite decades of study, it is not even known whether Q(n) is defined for all n. Mantovanelli introduced a parity-perturbed variant $\widetilde{Q}$, obtained by adding…
Golomb's sequence is the unique nondecreasing sequence of positive integers in which each $n$ appears exactly $a(n)$ times. It satisfies the global self-referential rule \[ a\bigl(a(n)+a(n-1)+\cdots+a(1)\bigr)=n, \] grows smoothly like a…
We revisit the golden sieve, a self-referential deletion process on increasing sequences of positive integers introduced by the author in 2002. Applied to the natural numbers, the sieve produces the Wythoff pair as a Beatty partition. For…
The orthorecursive expansion of unity with respect to the system $\{x, x^2, x^3, \ldots\}$ in $L^2([0,1])$ produces a sequence of rational coefficients $(c_n)$ defined by an explicit recurrence. Kalmynin and Kosenko established the bounds…
Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…
The Golomb--Keller formula expresses the next prime $p_{n+1}$ as a recurrence relation in terms of the first $n$ primes $p_1, \ldots, p_n$ using the Riemann zeta function and an Euler product, but requires taking a limit as $s \to \infty$,…
This paper presents a detailed, self-contained proof of a BBP-type formula for $\pi^2$ expressed in the golden ratio base, $\phi$. The formula was discovered empirically by the author in 2004. The proof presented herein is built upon a…
We introduce and analyze a three-parameter family of self-referential integer sequences $S(x,y,z)$: starting from $a(1)=x$, each term advances by $y$ when the index $k$ has already appeared as a value and by $z$ otherwise. This simple rule…
We derive a BBP-type formula for the remainder of the Madhava-Gregory-Leibniz series for $\pi$. The result is a closed form in base-$16$ with Pochhammer denominators. The analogous formula for the alternating series for $\log 2$ is also…
A family of nested recurrence relations $a(n+1) = n - a^{(m)}(n) + a^{(m+1)}(n)$, parameterized by an integer $m \ge 1$ with initial condition $a(1)=1$, is studied. We prove that $a(n)=n-h(n)$ is the unique solution satisfying this…
We introduce a new Tauberian framework through the theory of "regular arithmetic functions". This allows us to establish a characterization of the Riemann hypothesis by linking the floor function to the distribution of nontrivial zeros of…
We discuss an interesting sequence defined recursively; namely, sequence A105774 from the On-Line Encyclopedia of Integer Sequences, and study some of its properties. Our main tools are Fibonacci representation, finite automata, and the…
Using elementary means, we prove several identities involving the M\"obius function, generalizing in the multidimensional case well-known formulas coming from convolution arguments.
The aim of this paper is twofold. Firstly we present our main discovery arising from experiments which is the tauberian concept of functions of good variation (FGV). Secondly we propose to use these FGV for proving RH is true via some…
In this short note I present a tauberian conjecture that I consider to be the simplest and the best tauberian reformulation of RH using good variation theory. The method applies also to the Grand Riemann Hypothesis.
If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…