An integer sequence (xn)n≥0 is said to be Fibonacci-like if it satisfies the binary recurrence relation xn = xn−1 + xn−2, n ≥ 2. We construct a new type of Fibonacci-like sequence of composite numbers. 1 The problem and previous results In this paper we consider Fibonacci-like sequences, that is, sequences (xn) ∞ n=0 satisfying the binary recurrence relation xn = xn−1 + xn−2, n ≥ 2. (1)

Agriculture is the most important sector in terms of developing initiatives for increased efficiency and growth in the Zambian economy. The reason for this is that while agriculture only accounts for 21.7% of the GDP, it engages approximately 85% of the work force. (CIA The world Factbook) This is clearly indicative of economic inefficiencies. The aim of this paper is to look at various areas o...