A note on generalized Fibonacci numbers

Abstract

Starting from the simplest recurrence relations of second order, in this paper are suggested direct solutions obtained from a generalization of Pascal’s Triangle. With some binomial formulas, it isn’t necessary anymore to calculate roots of associated equations, and the extension of parameters’ definition field to the complex field can be done without any difficulty. The general cases in which the coefficients are functions of an integer variable are studied, too.