A new approach to generalized Fibonacci and Lucas numbers with binomial coefficients
dc.contributor.author | Gulec, H. H. | |
dc.contributor.author | Taskara, N. | |
dc.contributor.author | Uslu, K. | |
dc.date.accessioned | 2020-03-26T18:41:01Z | |
dc.date.available | 2020-03-26T18:41:01Z | |
dc.date.issued | 2013 | |
dc.department | Selçuk Üniversitesi | en_US |
dc.description.abstract | In this study, Fibonacci and Lucas numbers have been obtained by using generalized Fibonacci numbers. In addition, some new properties of generalized Fibonacci numbers with binomial coefficients have been investigated to write generalized Fibonacci sequences in a new direct way. Furthermore, it has been given a new formula for some Lucas numbers. (C) 2013 Elsevier Inc. All rights reserved. | en_US |
dc.identifier.doi | 10.1016/j.amc.2013.05.043 | en_US |
dc.identifier.endpage | 486 | en_US |
dc.identifier.issn | 0096-3003 | en_US |
dc.identifier.issn | 1873-5649 | en_US |
dc.identifier.scopusquality | Q1 | en_US |
dc.identifier.startpage | 482 | en_US |
dc.identifier.uri | https://dx.doi.org/10.1016/j.amc.2013.05.043 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/29164 | |
dc.identifier.volume | 220 | en_US |
dc.identifier.wos | WOS:000324558600049 | en_US |
dc.identifier.wosquality | Q1 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | ELSEVIER SCIENCE INC | en_US |
dc.relation.ispartof | APPLIED MATHEMATICS AND COMPUTATION | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Fibonacci number | en_US |
dc.subject | Lucas number | en_US |
dc.subject | Generalized Fibonacci number | en_US |
dc.subject | Binomial coefficients | en_US |
dc.title | A new approach to generalized Fibonacci and Lucas numbers with binomial coefficients | en_US |
dc.type | Article | en_US |