A new generalization of Delannoy numbers (Q828956)

In mathematics, a Delannoy number \(D\) describes the number of paths from the southwest corner \((0, 0)\) of a rectangular grid to the northeast corner \((m, n)\), using only single steps north, northeast, or east. The Delannoy numbers are named after French army officer and amateur mathematician Henri Delannoy. The Delannoy number \(D(m,n)\) also counts the number of global alignments of two sequences of lengths \(m\) and \(n\), the number of points in an \(m\)-dimensional integer lattice that are at most \(n\) steps from the origin and, in cellular automata, the number of cells in an \(m\)-dimensional von Neumann neighborhood of radius \(n\) while the number of cells on a surface of an \(m\)-dimensional von Neumann neighborhood of radius \(n\) is given with (sequence A266213 in the OEIS). In the paper under review, the author considers a new extension for Delannoy numbers and also derives several identities such as generating function and recurrence relations for these numbers.