Related papers: Picturesque convolution-like recurrences and parti…

Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…

Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…

For a sequence $\{a_n\}_{n\geq 0}$ of real numbers and for a parameter $0<p<1$, we define the sequence of its arithmetic means $\{a^*_n\}_{n\geq 0}$ and the sequence of its $p$-binomial means $\{a^p_n\}_{n\geq 0}$ as \begin{align*}…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

Let $\{a_n\}_1^\infty$ and $\{\theta_n\}_0^\infty$ be the sequences of partial quotients and approximation coefficients for the continued fraction expansion of an irrational number. We will provide a function $f$ such that $a_{n+1} =…

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

Let $\zeta(.)$ denote the Riemann zeta function and let $a(.)$ and $A(.)$ respectively denote a multiplicative function and its corresponding summatory function. We consider the correlation $$ \langle a(n)A(n-1) \rangle (T) =…

We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…

In this paper we consider error sums of the form \[\sum_{m=0}^{\infty} \varepsilon_m\Big( \,b_m\alpha - \frac{a_m}{c_m}\,\Big) \,,\] where $\alpha$ is a real number, $a_m$, $b_m$, $c_m$ are integers, and $\varepsilon_m=1$ or $\varepsilon_m…

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

Given $\beta\in(1,2)$ and $x\in[0,\frac{1}{\beta-1}]$, a sequence $(\epsilon_{i})_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion for $x$ if $$x=\sum_{i=1}^{\infty}\frac{\epsilon_{i}}{\beta^{i}}.$$ In a recent article…

First we define a new kind of function over $\mathbb{N}$. For each $i\in\mathbb{N}$ we have an associated function, which will be called $S_i$ . Then we define a new kind of sequence, to be made from the functions $S_i$ . Finally, we will…

Given a real number $0.a_1a_2 a_3\dots$ that is normal to base $b$, we examine increasing sequences $n_i$ so that the number $0.a_{n_1}a_{n_2}a_{n_3}\dots$ are normal to base $b$. Classically it is known that if the $n_i$ form an arithmetic…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…