Bilgici G.Bilgici, G2023-05-092023-05-092016-08-012016.01.010139-9918https://hdl.handle.net/20.500.12597/13681Narayana'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.falseBinet formula | generalized Narayana's cows number | generating function | matrix methodArticle10.1515/ms-2015-018110.1515/ms-2015-01812-s2.0-84994440934WOS:000387226200004795802661337-2211