A symmetric algorithm for hyper-fibonacci and hyper-lucas numbers

dc.contributor.authorBahşi, Mustafa
dc.contributor.authorMezö, İstvan
dc.contributor.authorSolak, Süleyman
dc.date.accessioned13.07.201910:50:10
dc.date.accessioned2019-07-16T08:22:35Z
dc.date.available13.07.201910:50:10
dc.date.available2019-07-16T08:22:35Z
dc.date.issued2014
dc.departmentEğitim Fakültesi
dc.description.abstractIn 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.
dc.identifier.endpage27en_US
dc.identifier.issn1787-5021
dc.identifier.scopusqualityQ3
dc.identifier.startpage19en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12451/2596
dc.identifier.volume43en_US
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherEszterhazy Karoly College
dc.relation.ispartofAnnales Mathematicae et Informaticae
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectHyper-Fibonacci Numbers
dc.subjectHyper-Lucas Numbers
dc.titleA symmetric algorithm for hyper-fibonacci and hyper-lucas numbers
dc.typeArticle

Dosyalar