Related papers: Picturesque convolution-like recurrences and parti…

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

A permutiple is a natural number whose representation in some base, $b>1$, is an integer multiple of a number whose base-$b$ representation has the same collection of digits. Previous efforts have made progress in finding such numbers using…

We propose sum rules for permutations $p_n(k)$ of the ensemble $\left\{1,2,\cdots,n\right\}$ with $k$ fixed points, in the form of partial sums of their moments. The corresponding identities involve Stirling numbers of the first kind…

Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…

In this paper we consider the fractional parts of a general sequence, for example the sequence $\alpha \sqrt{n}$ or $\alpha n^2$. We give a general method, which allows one to show that long-range correlations (correlations where the…

We briefly describe some well-known means and their properties, focusing on the relationship with integer sequences. In particular, the harmonic numbers, deriving from the harmonic mean, motivate the definition of a new kind of mean that we…

The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…

A sequence $\textbf{p}=(p_{n})$ of real numbers is called Abel convergent to $\ell$ if the series $\Sigma_{k=0}^{\infty}p_{k}x^{k}$ is convergent for $0\leq x<1$ and \[\lim_{x \to 1^{-}}(1-x) \sum_{k=0}^{\infty}p_{k}x^{k}=\ell.\] We…

In this note we associate a sequence of non-negative integers to any convergent series of positive real numbers and study this sequence for the series $\sum_{n \geq 1} n^{-k}$ where $k$ is an integer $\geq 2$.

The Landau-Selberg-Delange method provides an asymptotic formula for the partial sums of a multiplicative function whose average value on primes is a fixed complex number $v$. The shape of this asymptotic implies that $f$ can get very small…

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

We consider the multilinear polynomial-form process \[X(n)=\sum_{1\le i_1<\ldots<i_k<\infty}a_{i_1}\ldots a_{i_k}\epsilon_{n-i_1}\ldots\epsilon_{n-i_k},\] obtained by applying a multilinear polynomial-form filter to i.i.d.\ sequence…

In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…

This thesis is devoted to studying estimates of the least common multiple of some integer sequences. Our study focuses on effective bounding of the $\mathrm{lcm}$ of some class of quadratic sequences, as well as arithmetic progressions and…

We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

If $A(z)=\sum_{n=0}^\infty a_nz^n$ and $B(z)=\sum_{n=0}^\infty b_nz^n$ are two formal power series, with $a_n,b_n\in \mathbb{R}$, the polynomials $(p_n)_n$ defined by the generating function $$ A(z)B(xz)=\sum_{n=0}^\infty p_n(x)z^n $$ are…

Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…

The aim of this paper is to study the characteristics of a general method to produce a new approximation sequence from a given one, by using suitable convex combinations.