Diagonal sums in Pascal pyramid (Q2424905)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Diagonal sums in Pascal pyramid
scientific article

    Statements

    Diagonal sums in Pascal pyramid (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    In an analogy with the binomial coefficients arranged in the Pascal triangle, we can arrange the trinomial coefficients \((n;m_1m_2)\) in the shape of a pyramid called Pascal pyramid. Motivated by Binet's representation of a sum of binomial coefficients along ascending diagonals, \textit{H. Belbachir} et al. [Math. Slovaca 64, No. 2, 287--300 (2014; Zbl 1349.11037)] proved that if diagonals with arbitrary direction generate finite sums similarly, then they can be described by a suitable linear recurrence. In this paper, the authors describe a similar recurrence relation associated to the sum of diagonal elements lying along a finite ray of certain type crossing the Pascal pyramid and determine their generating function. Then they discuss the so-called Morgan-Voyce phenomenon, and prove an identity implying several recurrence relations conjectured in Sloane's On-Line Encyclopedia of Integer Sequences.
    0 references
    Pascal pyramid
    0 references
    ascending diagonal
    0 references
    sum of elements along a ray
    0 references
    linear recurrence
    0 references
    Morgan-Voyce phenomenon
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references