2010
DOI: 10.1515/integ.2010.057
|View full text |Cite
|
Sign up to set email alerts
|

On Binomial Sums for the General Second Order Linear Recurrence

Abstract: In this short paper we establish identities involving sums of products of binomial coefficients and coefficients that satisfy the general second-order linear recurrence. We obtain generalizations of identities of Carlitz, Prodinger and Haukkanen.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…Kilic [16] studied some binomial sums involving the (p, q)−Fibonacci numbers. The following theorem provides a similar sum formula for the Horadam symbol elements.…”
Section: Some Properties Of the Horadam Symbol Elementsmentioning
confidence: 99%
“…Kilic [16] studied some binomial sums involving the (p, q)−Fibonacci numbers. The following theorem provides a similar sum formula for the Horadam symbol elements.…”
Section: Some Properties Of the Horadam Symbol Elementsmentioning
confidence: 99%
“…More recently, some authors also worked on generalizations and derived expressions for sums with weighted binomial sums, sums with polynomials and sums where only half of the binomial coefficients are used. We refer to [2] and [10][11][12][13][14]. Adegoke [1] generalized many of the above results and derived summation identities involving Horadam numbers and binomial coefficients, some of which we will encounter below.…”
Section: Introductionmentioning
confidence: 99%
“…Horzum and Koçer studied the properties of Horadam polynomial sequences in [8]. The authors established identities involving sums of products of binomial coefficients that satisfy the general second order linear recurrence in [9]. In [10], the authors obtained Horadam numbers with positive and negative indices by using determinants of some special tridiagonal matrices.…”
Section: Introductionmentioning
confidence: 99%