English
Related papers

Related papers: Binomial Fibonacci sums from Chebyshev polynomials

200 papers

By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…

Combinatorics · Mathematics 2020-10-29 Oktay K. Pashaev , Merve Ozvatan

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…

Classical Analysis and ODEs · Mathematics 2007-05-23 Igor Rivin

The q-binomial coefficients are the polynomial cousins of the traditional binomial coefficients, and a number of identities for binomial coefficients can be translated into this polynomial setting. For instance, the familiar vanishing of…

Number Theory · Mathematics 2012-02-02 Andrew Schultz , Robert Walker

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

Number Theory · Mathematics 2014-10-01 Jhon J. Bravo , Carlos A. Gómez , Florian Luca

For integers $n,k \geq 1$, let $S_k(n)$ denote the power sum $1^k +2^k + \cdots + n^k$. In this note, we first recall the minimal recurrence relation connecting $S_k(n)$ and $S_{k-1}(n)$ established by Abramovich (1973). We then discuss an…

History and Overview · Mathematics 2026-01-30 José L. Cereceda

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…

Combinatorics · Mathematics 2025-11-13 Chai Wah Wu

Let $(a_n)_{n\geq 0}$ be an arbitrary sequence and $(a_{\lfloor n/k \rfloor})_{n\geq 0}$ its dual floor sequence. We study infinite series and finite generalized binomial sums involving $(a_{\lfloor n/k \rfloor})_{n\geq 0}$. As applications…

Combinatorics · Mathematics 2023-03-29 Kunle Adegoke , Robert Frontczak , Taras Goy

In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum $$\sum_{k\equiv r(\mbox{mod}m)}{n\choose k}a^k.$$ In this paper, we show that the sum can be expressed…

Number Theory · Mathematics 2016-09-27 Jiangshuai Yang , Yingpu Deng

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…

Classical Analysis and ODEs · Mathematics 2026-03-12 Vitaly M. Khamitov , Dmitriy Dmitrishin , Alexander Stokolos , Daniel Gray

We establish two general identities for Bernoulli and Euler polynomials, which are of a new type and have many consequences. The most striking result in this paper is as follows: If $n$ is a positive integer, $r+s+t=n$ and $x+y+z=1$, then…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun , Hao Pan

In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.

Number Theory · Mathematics 2015-03-04 Pingzhi Yuan , Zilong He , Junyi Zhuo

The coefficients c(n,k) defined by (1-k^2x)^(-1/k) = sum c(n,k) x^n reduce to the central binomial coefficients for k=2. Motivated by a question of H. Montgomery and H. Shapiro for the case k=3, we prove that c(n,k) are integers and study…

Number Theory · Mathematics 2015-05-13 Armin Straub , Tewodros Amdeberhan , Victor H. Moll

A second order polynomial sequence is of \emph{Fibonacci-type} (\emph{Lucas-type}) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Known examples of these type of sequences are: Fibonacci polynomials,…

Number Theory · Mathematics 2018-08-06 Rigoberto Flórez , Robinson Higuita , Alexander Ramírez

The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…

Number Theory · Mathematics 2019-12-10 M. J. Kronenburg

Let $(F_n)_{n\ge 1}$ be the Fibonacci sequence. Define $P(F_n): = (\sum_{i=1}^n F_i)_{n\ge 1}$; that is, the function $P$ gives the sequence of partial sums of $(F_n)$. In this paper, we first give an identity involving $P^k(F_n)$, which is…

Combinatorics · Mathematics 2021-06-08 Hung Viet Chu

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

Number Theory · Mathematics 2015-06-26 Victor J. W. Guo , Frederic Jouhet , Jiang Zeng

Our objective in this paper is to introduce and investigate a newly-constructed subclass of normalized analytic and bi-univalent functions by means of the Chebyshev polynomials of the second kind. Upper bounds for the second and third…

Complex Variables · Mathematics 2021-02-18 Feras Yousef , Somaia Alroud , Mohamed Illafe

In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev…

Number Theory · Mathematics 2016-03-28 Elif Ercan , Mirac Cetin Firengiz , Naim Tuglu

We derive generalizations of a couple of inverse tangent summation identities involving Fibonacci and Lucas numbers. As byproducts we establish many new inverse tangent identities involving the Fibonacci and Lucas numbers.

Number Theory · Mathematics 2019-10-24 Kunle Adegoke

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

Number Theory · Mathematics 2023-04-07 Martin Bunder , Joseph Tonien