5 citations · 5 across the 3 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2024
Explicit solution of system of two higher-order recurrences
László Németh, László Szalay
We give a method to determine an explicit solution to a system of two inhomogeneous linear recursive sequences of higher order. Our approach can be used efficiently in solving cert…
math.NT2024
On certain Fibonacci representations
Kálmán Liptai, László Németh, Tamás Szakács +1
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In…
math.NT2017★ 5 cited
Recurrence sequences in the hyperbolic Pascal triangle corresponding to the regular mosaic $\{4,5\}
László Németh, László Szalay
Recently, a new generalization of Pascal's triangle, the so-called hyperbolic Pascal triangles were introduced. The mathematical background goes back to the regular mosaics in the…