A Symmetric Algorithm for Golden Ratio in Hyper-Horadam Numbers

Abstract

We study some ratios related to hyper-Horadam numbers such as Wnr/Wn-1r while n→∞ by using a symmetric algorithm obtained by the recurrence relation ank=ank-1+an-1k, where Wnr is the nth hyper-Horadam number. Also, we give some special cases of these ratios such as the golden ratio and silver ratio.

On The Norms of Another Form of $r-$Circulant Matrices with The Hyper-Fibonacci and Lucas Numbers

“…Proof. Since the matrix F r is of the form 2) k rF (3) k rF (4) k…”

“…In [4], the authors defined hyper-Horadam numbers and studied their some properties. Also, they gave the following formulas related to sums of hyper -Fibonacci and hyper -Lucas…”

“…For more information related to hyper -Fibonacci numbers see [4,7,9]. Now we give some definitions and lemmas related to our study.…”

“…. rL(2) k rL(3) k rL(4) k• • • L (0) k L(1) k rL(1) k rL(2) k rL(3) k…”

A new formula for hyper-Fibonacci numbers, and the number of occurrences

“…First consider the sum of the coefficients. Replace n by 1 in (2), which together with F…”