Related papers: An integrality phenomenon
A new family of sequences is proposed. An example of sequence of this family is more accurately studied. This sequence is composed by the integers $n$ for which the sum of binary digits is equal to the sum of binary digits of $n^2$. Some…
In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation. We prove these results using a special case of an universal property…
The Euler-Maclaurin formula which relates a discrete sum with an integral, is generalised to the setting of Riemann-Stieltjes sums and integrals on stochastic processes whose paths are a.s. rectifiable, namely, continuous and with bounded…
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…
This paper further generalizes a recent result of Shannon and Ollerton who resurrected an old identity due to Ledin. This paper generalizes the Ledin-Shannon-Ollerton result to all the metallic sequences. The results give closed formulas…
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…
Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order at least two defined over a function field and $\mathcal{O}_S^*$ be the set of $S$-units. In this paper, we use a result of Brownawell and Masser to prove…
Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by…
Let $(P_n)_n$ and $(Q_n)_n$ be two sequences of monic polynomials linked by a type structure relation such as $$ Q_{n}(x)+r_nQ_{n-1}(x)=P_{n}(x)+s_nP_{n-1}(x)+t_nP_{n-2}(x)\;, $$ where $(r_n)_n$, $(s_n)_n$ and $(t_n)_n$ are sequences of…
We consider complete convergence and closely related Hsu-Robbins-Erdos-Spitzer-Baum-Katz series for sums whose terms are elements of a linear 2-nd order autoregressive sequences of random variables and prove sufficient conditions for the…
Let $\{B_n\}$, $\{B_n(x)\}$ and $\{E_n(x)\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\sum_{6\mid k-3}\binom nkB_{n-k}(x)$, $\sum_{6\mid k}\binom…
This paper presents both a proof method and a result. The proof method presented is particularly suitable for uniformly proving families of identities satisfied by a family of recursive sequences. To illustrate the method, we study the…
We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…
We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…
Almkvist and Meurman showed that if h and k are integers, then so is $k^n(B_n(h/k) - B_n)$ where $B_n(u)$ is the Bernoulli polynomial. We give here a new and simpler proof of the Almkvist-Meurman theorem using generating functions. We…
The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…
A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$…
The Burchnall-Chaundy polynomials $P_n(z)$ are determined by the differential recurrence relation $$P_{n+1}'(z)P_{n-1}(z)-P_{n+1}(z)P_{n-1}'(z)=P_n(z)^2$$ with $P_{-1}=P_0(z)=1.$ The fact that this recurrence relation has all solutions…
We evaluate in closed form series of the type $\sum u(n) R(n)$, where $(u(n))_n$ is a strongly $B$-multiplicative sequence and $R(n)$ a (well-chosen) rational function. A typical example is: $$ \sum_{n \geq 1} (-1)^{s_2(n)}…