We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment, or being absorbed. We obtain expected number of arrivals and expected time until absorption using a new concept: Fibonacci matrices.