Abstract: In this paper, we describe a method to determine the power sum of the elements of the rows in the hyperbolic Pascal triangles corresponding to with . The method is based on the theory of linear recurrences, and the results are demonstrated by evaluating the power sum in the range .
Recommendations
Cited in
(13)- A generalization of hyperbolic Pascal triangles
- A Pascal-like triangle from finding power sums
- Recurrence sequences in the hyperbolic Pascal triangle corresponding to the regular mosaic \(\{4, 5\}\)
- Tilings of hyperbolic (2 n)-board with colored squares and dominoes
- Sequences involving square zig-zag shapes
- Tilings of \((2 \times 2 \times n)\)-board with coloured cubes and bricks
- Alternating sums in hyperbolic Pascal triangles
- Linear vector recursions of arbitrary order
- Explicit solution of system of two higher-order recurrences
- Alternating sums in the generalized hyperbolic Pascal triangle
- A generalization of the hyperbolic Pascal pyramid
- On two-variable recurrence sequences with a tiling application
- Polynomial values of sums of hyperbolic binomial coefficients
This page was built for publication: Power sums in hyperbolic Pascal triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227879)