Abstract. The notion of the generalized Fibonacci matrix F(a;b;s)n of type s, whose nonzero elements are generalized Fibonacci numbers, is introduced in the paper [23]. Regular case s = 0 is investigated in [23]. In the present article we consider singular case s = 1. Pseudoinverse of the generalized Fibonacci matrix F(a;b;1)n is derived. Correlations between the matrix F(a;b;1)n and the Pascal matrices are considered. Some combinatorial identities involving generalized Fibonacci numbers are derived. A class of test matrices for computing the Moore-Penrose inverse is presented in the last section. 1
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Abstract The Fibonacci sequence, Lucas numbers and their generalization have many interesting proper...
AbstractThe Fibonomial coefficients are known as interesting generalizations of binomial coefficient...
We give divisibility properties of the generalized Fibonacci sequence by matrix methods. We also pre...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
AbstractWe define the matrix Un(a,b,s) of type s, whose elements are defined by the general second-o...
AbstractDi Porto and Filipponi recently described a generalization of the standard test for an odd c...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
AbstractThe Pascal matrix and the Stirling matrices of the first kind and the second kind obtained f...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Copyright © 2014 Mamta Singh et al. This is an open access article distributed under the Creative Co...
In this study we define the generalized k-order Fibonacci matrix and the n x n generalized Pascal ma...
In this study we define the generalized k-order Fibonacci matrix and the n x n generalized Pascal ma...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Abstract The Fibonacci sequence, Lucas numbers and their generalization have many interesting proper...
AbstractThe Fibonomial coefficients are known as interesting generalizations of binomial coefficient...
We give divisibility properties of the generalized Fibonacci sequence by matrix methods. We also pre...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
AbstractWe define the matrix Un(a,b,s) of type s, whose elements are defined by the general second-o...
AbstractDi Porto and Filipponi recently described a generalization of the standard test for an odd c...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
AbstractThe Pascal matrix and the Stirling matrices of the first kind and the second kind obtained f...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Copyright © 2014 Mamta Singh et al. This is an open access article distributed under the Creative Co...
In this study we define the generalized k-order Fibonacci matrix and the n x n generalized Pascal ma...
In this study we define the generalized k-order Fibonacci matrix and the n x n generalized Pascal ma...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix...
Abstract The Fibonacci sequence, Lucas numbers and their generalization have many interesting proper...