English
Related papers

Related papers: Fibonacci-Catalan Series

200 papers

In this paper, some $k$-Fibonacci and $k$-Lucas with arithmetic indexes sums are derived by using the matrices $R_{a}=\left[ \begin{array}{lr} L_{k,a} & -(-1)^{a} \\ 1 & 0 \end{array}\right]$ and $S_{a}=\frac{1}{2}\left[ \begin{array}{lr}…

Combinatorics · Mathematics 2014-10-24 Gamaliel Cerda

With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…

Mathematical Software · Computer Science 2013-07-05 Pietro Codara , Ottavio M. D'Antona

This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…

Combinatorics · Mathematics 2026-04-24 Nick Vorobtsov

Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping,…

Combinatorics · Mathematics 2016-08-09 Gaurav Bhatnagar

We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…

Number Theory · Mathematics 2020-09-22 Robert Frontczak , Taras Goy

Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present…

Combinatorics · Mathematics 2016-01-05 Hasan Coskun

We introduce a combinatorial enumeration problem that is solved using generalized Catalan numbers. We also study generalizations of the Cycle Lemma beyond the computation of the generalized Catalan numbers.

Combinatorics · Mathematics 2007-05-23 Hunter S. Snevily , Douglas B. West

We develop new closed form representations of sums of (n + {\alpha})th shifted harmonic numbers and reciprocal binomial coefficients in terms of {\alpha}th shifted harmonic numbers. Some interesting new consequences and illustrative…

Number Theory · Mathematics 2017-03-30 Ce Xu

The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…

History and Overview · Mathematics 2018-11-07 Bernhard Moser

We give some results and conjectures about recurrence relations for certain sequences of binomial sums.

Combinatorics · Mathematics 2007-05-23 Johann Cigler

The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.

Combinatorics · Mathematics 2015-02-24 Helmut Prodinger

The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…

Number Theory · Mathematics 2017-05-31 Kyunghwan Song , Youngwoo Kwon

We give conjectures on the form of families of integer sequences whose Hankel transforms are, respectively, $(\alpha, \beta)$ Somos $4$ sequences, $(\alpha, 0, \gamma)$ Somos $6$ sequences, and $(\alpha, \beta, \gamma, \delta)$ Somos $8$…

Combinatorics · Mathematics 2022-11-24 Paul Barry

In type A, the q,t-Fuss -Catalan numbers can be defined as a bigraded Hilbert series of a module associated to the symmetric group S_n. We generalize this construction to (finite) complex reflection groups and exhibit some nice conjectured…

Combinatorics · Mathematics 2008-06-19 Christian Stump

We analyze a weighted convolution of Catalan numbers $$ \sum_{k=0}^{n} \binom{2k}{k}\binom{2(n-k)}{n-k} a^k = \sum_{k=0}^{n} (k+1)(n-k+1) C_k C_{n-k} a^k, $$ emphasizing its combinatorial, analytic, and probabilistic aspects. We derive a…

Combinatorics · Mathematics 2026-04-24 Jean-Christophe Pain

Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (u_{n})_{n>=0}=(3,2,3,6,14,36,...): they count "aligned cubic trees" on n internal vertices. Here we give…

Combinatorics · Mathematics 2007-05-23 David Callan

In this paper, using a generating function approach, we derive several new convolution sum identities involving Fibonacci m-step numbers. As special instances of the results derived herein, we will get many new and known results involving…

General Mathematics · Mathematics 2024-04-01 Robert Frontczak , Karol Gryszka

In this paper, we present a formula for generating various exotic series in the spirit of Ovidiu Furdui and Alina Sintamarian. Our new series (evaluated in closed form) involve Bernoulli, harmonic, and Catalan numbers. Also Stirling numbers…

Combinatorics · Mathematics 2021-10-05 Khristo N. Boyadzhiev

We mainly show a supercongruence for a truncated series with cubes of Catalan numbers which extends a result by Zhi-Wei Sun.

Number Theory · Mathematics 2018-08-02 Roberto Tauraso

We present a new alternating convolution formula for the super Catalan numbers which arises as a generalization of two known binomial identities. We prove a generalization of this formula by using auxiliary sums, recurrence relations, and…

Combinatorics · Mathematics 2021-10-12 Jovan Mikić