Related papers: Binomial convolutions for rational power series
In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…
We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…
Given a holonomic sequence $F(n)$, we characterize rational functions $r(n)$ so that $r(n)F(n)$ can be summable. We provide upper and lower bounds on the degree of the numerator of $r(k)$ and show the denominator of $r(n)$ can be read from…
We study properties of functions of binomial coefficients mod 2 and derive a set of recurrence relations for sums of products of binomial coefficients mod 2. We show that they result in sequences that are the run length transforms of well…
We show that double sums of the form $$ \sum_{i,j=-n} ^{n} |i^sj^t(i^k-j^k)^\beta| \binom {2n} {n+i} \binom {2n} {n+j} $$ can always be expressed in terms of a linear combination of just four functions, namely $\binom {4n}{2n}$, ${\binom…
Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…
Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referrenced and documented components (namely Sierpi\'nski's polynomials, the Thue-Morse…
Horadam sequences and their partial sums are computed via generating functions. The results are as simple as possible.
The balancing numbers $B_n$ ($n=0,1,\cdots$) are solutions of the binary recurrence $B_n=6B_{n-1}-B_{n-2}$ ($n\ge 2$) with $B_0=0$ and $B_1=1$. In this paper we show several relations about the sums of product of two balancing numbers of…
Let $\mathbf{P}^{m}_{b}(x)$ be a $2m+1$-degree polynomial in $x$ and $b \in \mathbb{R}$ \[ \mathbf{P}^{m}_{b}(x) = \sum_{k=0}^{b-1} \sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r \] where $\mathbf{A}_{m,r}$ are real coefficients. In this…
We introduce a shifted version of the binomial theorem, and use it to study some remarkable trigonometric integrals and their explicit rewriting in terms of binomial multiple sums. Motivated by the expressions of area generating functions…
In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…
Algorithms for computing rational generating functions of solutions of one-dimensional difference equations are well-known and easy to implement. We propose an algorithm for computing rational generating functions of solutions of…
We sum multivariate generating functions composed of products of Chebyshev polynomials of the first and the second kind. That is, we find closed forms of expressions of the type $\sum_{j\geq0}\rho^{j}\prod_{m=1}^{k}T_{j+t_{m}}%…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
In this work, a sequence of orthonormal rational functions that is also biorthogonal to another sequence of rational functions arising from recurrence relations of $R_{II}$ type is constructed. The biorthogonality is proved by a procedure…
We present an approach (the biroot method) for nth root approximation that yields closed-form rational functions with coefficients derived from binomial structures, Gaussian functions, or qualifying DAG structures. The method emerges from…