Bahşi, MustafaMezö, İstvanSolak, Süleyman13.07.20192019-07-1613.07.20192019-07-1620141787-5021https://hdl.handle.net/20.500.12451/2596In this work we study some combinatorial properties of hyper-Fibonacci, hyper-Lucas numbers and their generalizations by using a symmetric algorithm obtained by the recurrence relation (formula presented). We point out that this algorithm can be applied to hyper-Fibonacci, hyper-Lucas and hyper-Horadam numbers. © 2014, Eszterhazy Karoly College. All rights reserved.eninfo:eu-repo/semantics/closedAccessHyper-Fibonacci NumbersHyper-Lucas NumbersA symmetric algorithm for hyper-fibonacci and hyper-lucas numbersArticle431927Q3