Gaussian Padovan and Gaussian Perrin numbers and properties of them

2019 ◽  
Vol 12 (06) ◽  
pp. 2040014
Author(s):  
Meral Yaşar Kartal
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Binet Formula

In this paper, the Gaussian Padovan and Gaussian Perrin numbers are defined. Then Binet formula and generating functions of these numbers are given. Also, some summation identities for Gaussian Padovan and Gaussian Perrin numbers are obtained by using the recurrence relation satisfied by them. Then two relations are given between Gaussian Padovan and Gaussian Perrin numbers.

Gaussian third-order Jacobsthal and Gaussian third-order Jacobsthal–Lucas polynomials and their properties

2020 ◽  
pp. 2150076
Author(s):  
Gamaliel Cerda-Morales
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Third Order ◽  
Lucas Polynomials ◽  
Binet Formula

In this paper, the Gaussian third-order Jacobsthal and Gaussian third-order Jacobsthal–Lucas polynomials are defined. Then Binet formula and generating functions of these numbers are given. Also, some summation identities for Gaussian third-order Jacobsthal and Gaussian third-order Jacobsthal–Lucas polynomials are obtained by using the recurrence relation satisfied by them. Then, some linear and quadratic relations are given between Gaussian third-order Jacobsthal and Gaussian third-order Jacobsthal–Lucas polynomials.

scholarly journals Explicit Formulas for the First Form (q,r)-Dowling Numbers and (q,r)-Whitney-Lah Numbers

2021 ◽  
Vol 14 (1) ◽  
pp. 65-81
Author(s):  
Roberto Bagsarsa Corcino ◽  
Jay Ontolan ◽  
Maria Rowena Lobrigas
Keyword(s):  
Recurrence Relation ◽  
Explicit Formula ◽  
Taylor Series ◽  
Generating Functions ◽  
Recurrence Relations ◽  
Difference Operator ◽  
Interpolation Formula ◽  
Explicit Formulas ◽  
Fundamental Properties ◽  
Whitney Numbers

In this paper, a q-analogue of r-Whitney-Lah numbers, also known as (q,r)-Whitney-Lah number, denoted by $L_{m,r} [n, k]_q$ is defined using the triangular recurrence relation. Several fundamental properties for the q-analogue are established such as vertical and horizontal recurrence relations, horizontal and exponential generating functions. Moreover, an explicit formula for (q, r)-Whitney-Lah number is derived using the concept of q-difference operator, particularly, the q-analogue of Newton’s Interpolation Formula (the umbral version of Taylor series). Furthermore, an explicit formula for the first form (q, r)-Dowling numbers is obtained which is expressed in terms of (q,r)-Whitney-Lah numbers and (q,r)-Whitney numbers of the second kind.

scholarly journals Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions

Filomat ◽  
2018 ◽  
Vol 32 (20) ◽  
pp. 6879-6891
Author(s):  
Irem Kucukoglu ◽  
Yilmaz Simsek
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Stirling Numbers ◽  
Bell Numbers ◽  
New Family ◽  
Derivative Formulas ◽  
Combinatorial Sums ◽  
Computation Algorithm ◽  
Fractional Derivative Operators ◽  
And Inversion

The first aim of this paper is to give identities and relations for a new family of the combinatorial numbers and the Apostol-Euler type numbers of the second kind, the Stirling numbers, the Apostol-Bernoulli type numbers, the Bell numbers and the numbers of the Lyndon words by using some techniques including generating functions, functional equations and inversion formulas. The second aim is to derive some derivative formulas and combinatorial sums by applying derivative operators including the Caputo fractional derivative operators. Moreover, we give a recurrence relation for the Apostol-Euler type numbers of the second kind. By using this recurrence relation, we construct a computation algorithm for these numbers. In addition, we derive some novel formulas including the Stirling numbers and other special numbers. Finally, we also some remarks, comments and observations related to our results.

scholarly journals ON THE BINOMIAL TRANSFORMS OF THE HORADAM QUATERNION SEQUENCES

2020 ◽  
Author(s):  
Faruk Kaplan ◽  
Arzu Özkoç Öztürk
Keyword(s):  
Recurrence Relation ◽  
General Formula ◽  
Generating Function ◽  
Second Order ◽  
Binet Formula ◽  
New Type ◽  
Binomial Transform

The main object of the present paper is to consider the binomial transforms for Horadam quaternion sequences. We gave new formulas for recurrence relation, generating function, Binet formula and some basic identities for the binomial sequence of Horadam quaternions. Working with Horadam quaternions, we have found the most general formula that includes all binomial transforms with recurrence relation from the second order. In the last part, we determined the recurrence relation for this new type of quaternion by working with the iterated binomial transform, which is a dierent type of binomial transform.

scholarly journals Summing a Family of Generalized Pell Numbers

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Helmut Prodinger
Keyword(s):  
Linear Combination ◽  
Computer Algebra ◽  
Generating Functions ◽  
Fibonacci Numbers ◽  
Partial Sums ◽  
Pell Numbers ◽  
New Family ◽  
Binet Formula

AbstractA new family of generalized Pell numbers was recently introduced and studied by Bród ([2]). These numbers possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of generalized Pell numbers can be summed explicitly. For this, as a first step, a power P lnis expressed as a linear combination of Pmn. The summation of such expressions is then manageable using generating functions. Since the new family contains a parameter R = 2r, the relevant manipulations are quite involved, and computer algebra produced huge expressions that where not trivial to handle at times.

scholarly journals Multi-Lah numbers and multi-Stirling numbers of the first kind

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Dae San Kim ◽  
Hye Kyung Kim ◽  
Taekyun Kim ◽  
Hyunseok Lee ◽  
Seongho Park
Keyword(s):  
Recurrence Relation ◽  
Generating Functions ◽  
Stirling Numbers ◽  
Bernoulli Numbers

AbstractIn this paper, we introduce multi-Lah numbers and multi-Stirling numbers of the first kind and recall multi-Bernoulli numbers, all of whose generating functions are given with the help of multiple logarithm. The aim of this paper is to study several relations among those three kinds of numbers. In more detail, we represent the multi-Bernoulli numbers in terms of the multi-Stirling numbers of the first kind and vice versa, and the multi-Lah numbers in terms of multi-Stirling numbers. In addition, we deduce a recurrence relation for multi-Lah numbers.

scholarly journals On Generating Functions

1930 ◽  
Vol 2 (2) ◽  
pp. 71-82 ◽  
Author(s):  
W. L. Ferrar
Keyword(s):  
Differential Equation ◽  
Recurrence Relation ◽  
Generating Function ◽  
Generating Functions ◽  
Order Differential Equation ◽  
Second Order ◽  
Second Order Differential Equation ◽  
Image Position ◽  
Three Term Recurrence Relation ◽  
Sequence Of Functions

It is well known that the polynomial in x,has the following properties:—(A) it is the coefficient of tn in the expansion of (1–2xt+t2)–½;(B) it satisfies the three-term recurrence relation(C) it is the solution of the second order differential equation(D) the sequence Pn(x) is orthogonal for the interval (— 1, 1),i.e. whenSeveral other familiar polynomials, e.g., those of Laguerre Hermite, Tschebyscheff, have properties similar to some or all of the above. The aim of the present paper is to examine whether, given a sequence of functions (polynomials or not) which has one of these properties, the others follow from it : in other words we propose to examine the inter-relation of the four properties. Actually we relate each property to the generating function.

scholarly journals Viewing Determinants as Nonintersecting Lattice Paths yields Classical Determinantal Identities Bijectively

10.37236/2530 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Markus Fulmek
Keyword(s):  
Generating Functions ◽  
Point Of View ◽  
Lattice Paths ◽  
Binet Formula ◽  
Plücker Relations ◽  
Nonintersecting Lattice Paths ◽  
Determinantal Identities ◽  
Determinantal Identity

In this paper, we show how general determinants may be viewed as generating functions of nonintersecting lattice paths, using the Lindström-Gessel-Viennot-method and the Jacobi Trudi identity together with elementary observations.After some preparations, this point of view provides "graphical proofs'' for classical determinantal identities like the Cauchy-Binet formula, Dodgson's condensation formula, the Plücker relations, Laplace's expansion and Turnbull's identity. Also, a determinantal identity generalizing Dodgson's condensation formula is presented, which might be new.

Sign in / Sign up

Export Citation Format

Share Document