Some computational formulas for \(D\)-Nörlund numbers

DOI10.1155/2009/430452zbMath1194.11028OpenAlexW2330428807WikidataQ58646597 ScholiaQ58646597MaRDI QIDQ963152

Guodong Liu

Publication date: 8 April 2010

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/226181

zbMATH Keywords

identitiesgenerating functionBernoulli numbers\(D\) numbers\(D\)-Nörlund numberscentral factorial numbers of the first kindcomputational formulas

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Binomial coefficients; factorials; (q)-identities (11B65) Bernoulli and Euler numbers and polynomials (11B68) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Related Items (2)

Evaluation of spherical GJMS determinants ⋮ A recurrence formula for \(D\) numbers \(D_{2n}^{(2n-1)}\)

Cites Work

• Some determinants involving Bernoulli and Euler numbers of higher order
• Applications of an explicit formula for the generalized Euler numbers
• Summation and recurrence formula involving the central factorial numbers and zeta function.
• Some identities involving the central factorial numbers and Riemann zeta function.
• On congruences of Euler numbers modulo powers of two
• Explicit formulas for the Nörlund polynomials \(B_n^{(x)}\) and \(b_n^{(x )}\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some computational formulas for \(D\)-Nörlund numbers