A symmetric algorithm for golden ratio in hyper-Horadam numbers (Q523587)

Summary: We study some ratios related to hyper-Horadam numbers such as \(W_n^{\left(r\right)} / W_{n - 1}^{\left(r\right)}\) while \(n \to \infty\) by using a symmetric algorithm obtained by the recurrence relation \(a_n^k = a_n^{k - 1} + a_{n - 1}^k\), where \(W_n^{\left(r\right)}\) is the \(n\)th hyper-Horadam number. Also, we give some special cases of these ratios such as the golden ratio and silver ratio.