Related papers: Summing a family of generalized Pell numbers
Let ``Faulhaber's formula'' refer to an expression for the sum of powers of integers written with terms in n(n+1)/2. Initially, the author used Faulhaber's formula to explain why odd Bernoulli numbers are equal to zero. Next, Cereceda gave…
The partial sums of two quartic basic hypergeometric series are investigated by means of the modified Abel lemma on summation by parts. Several summation and transformation formulae are consequently established.
In this paper, we present a new real-valued Appell-type polynomial family $A_n^{(k)}(m,x), $ every member of which is expressed by mean of a generalized hypergeometric function. The generating exponential function of this type of…
Summation of a large class of the functional series, which terms contain factorials, is considered. We first investigated finite partial sums for integer arguments. These sums have the same values in real and all p-adic cases. The…
This text provides very easy and short proofs of some basic properties of complex power series (addition, subtraction, multiplication, division, rearrangement, composition, differentiation, uniqueness, Taylor's series, Principle of…
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
By using the generalized Bernoulli numbers, we deduce new integral representations for the Riemann zeta function at positive odd-integer arguments. The explicit expressions enable us to obtain criteria for the dimension of the vector space…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
We will generalize the combinatorial algorithms for computing $\pi(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.
In this paper, we find all Fibonacci numbers which are products of two Pell numbers and all Pell numbers which are products of two Fibonacci numbers.
We show that explicit forms for certain polynomials~$\psi^{(a)}_m(n)$ with the property \[ \psi^{(a+1)}_m(n) = \sum_{\nu=1}^n \psi_m^{(a)}(\nu) \] can be found (here, $a,m,n\in\mathbb{N}_0$). We use these polynomials as a basis to express…
This paper presents both a method and a result. The result presents a closed formula for the sum of the first $m+1,m \ge 0,$ squares of the sequence $F^{(k)}$ where each member is the sum of the previous $k$ members and with initial…
All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the…
We provide a novel representation of the total n-th derivative of the multivariate composite function $f \circ g$, i.e. a generalized Fa\`a di Bruno's formula. To this end, we make use of properties of the Kronecker product and the n-th…
We introduce a new representation for the rescaled Appell polynomials and use it to obtain asymptotic expansions to arbitrary order. This representation consists of a finite sum and an integral over a universal contour (i.e. independent of…
We present a new formula for the highest power of $a+b$ that divides the sum $B(n,m,a,b)=\sum_{k=0}^{n}\binom{n}{k}^m a^{n-k}b^k$ for the case $m=2$. By using this formula, we give complete 3-adic valuation for central Dellanoy numbers.…
In this paper, we investigate sums of three Fibonacci numbers that can be expressed as concatenations of three repdigits in base $b$, where $b\ge 2$ is an integer. We prove that for bases $2\le b\le 10$, only finitely many such sums exist,…
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive $1$s. Munarini introduced Pell graphs, a variation of Fibonacci cubes defined on ternary strings. A generalization of Pell graphs…
We use an interpolative technique from \cite{abps} to introduce the notion of multiple $N$-separately summing operators. Our approach extends and unifies some recent results; for instance we recover the best known estimates of the…