Publication:
The generalized order-k Narayana's cows numbers

Simple item page
dc.contributor.authorBilgici G.
dc.contributor.authorBilgici, G
dc.date.accessioned2023-05-09T18:48:24Z
dc.date.available2023-05-09T18:48:24Z
dc.date.issued2016-08-01
dc.date.issued2016.01.01
dc.description.abstractNarayana's cows problem is a problem similar to the Fibonacci's rabbit problem. We define the numbers which are the solutions of this problem as Narayana's cows numbers. Narayana's cows sequence satisfies the third order recurrence relation Nr = Nr-1+Nr-3 with initial condition N0 = N1 = N2 = 1. In this paper, we define a new recurrence which is called generalized order-k Narayana's cows sequence and by using this generalization and some matrix properties, we give some identities related to the Narayana's cows numbers.
dc.identifier.doi10.1515/ms-2015-0181
dc.identifier.eissn1337-2211
dc.identifier.endpage802
dc.identifier.issn0139-9918
dc.identifier.scopus2-s2.0-84994440934
dc.identifier.startpage795
dc.identifier.urihttps://hdl.handle.net/20.500.12597/13681
dc.identifier.volume66
dc.identifier.wosWOS:000387226200004
dc.relation.ispartofMathematica Slovaca
dc.relation.ispartofMATHEMATICA SLOVACA
dc.rightsfalse
dc.subjectBinet formula | generalized Narayana's cows number | generating function | matrix method
dc.titleThe generalized order-k Narayana's cows numbers
dc.titleTHE GENERALIZED ORDER-k NARAYANA'S COWS NUMBERS
dc.typeArticle
dspace.entity.typePublication
oaire.citation.issue4
oaire.citation.volume66
relation.isScopusOfPublication722752a0-60ce-45c9-b24d-a814dd4bc8b2
relation.isScopusOfPublication.latestForDiscovery722752a0-60ce-45c9-b24d-a814dd4bc8b2
relation.isWosOfPublication6269dce2-42c8-4e41-bc65-d5163e2e4d21
relation.isWosOfPublication.latestForDiscovery6269dce2-42c8-4e41-bc65-d5163e2e4d21

Files

Collections

Tüm Yayınlar