Keywords: fibonacci number, lucas number, fibonacci like sequence
Turkish Journal of Analysis and Number Theory, 2014 2 (4),
pp 110112.
DOI: 10.12691/tjant241
Received June 01, 2014; Revised July 10, 2014; Accepted July 17, 2014
Copyright © 2013 Science and Education Publishing. All Rights Reserved.
1. Introduction
It is well known that the Fibonacci numbers and polynomials are of great importance in the study of many subjects such as algebra, geometry, combinatorics, approximation theory, graph theory and number theory itself.
They occur in a variety of other fields such as finance, art, architecture, music, etc.
One may notice several practical and effective instruments for calculating determinants in the nice survey articles ^{[6]} and ^{[9]}. Much attention has been paid to the evaluation of determinants of matrices, especially when their entries are given recursively ^{[7]}. There is a long tradition of using matrices and determinants to study Fibonacci numbers. Bicknell – Johnson and Spears ^{[2]} use elementary matrix operationand determinants to generate classes of identities for generalized Fibonacci numbers. Cahill and Narayan ^{[4]} show how Fibonacci and Lucas numbers arise as determinants of some tridiagonal matrices. T. Benjamin, T. Cameron and J. Quinn ^{[1]}, provides combinatorial interpretations for Fibonacci identities using determinants. Koshy ^{[5]} explained two chapters on the useof matrices and determinants in Fibonacci numbers.
Spivey ^{[9]} describe the sum property for determinants and presented new proofs of identities like the Cassini identity, the d'Ocagne identity and the Catalan identity.
Macfarlane ^{[8]} use the property for determinants to give new identities involving Fibonacci and related number is defined by the recurrence relation,
Lucas sequence is defined by the recurrence relation,
The Fibonacci Like sequence ^{[3]} is defined by recurrence relation,
first few numbers of FibonacciLike sequences are 2, 2, 4, 6, 10, 16, and so on
Theorem 1 For every integer n 0 :
Theorem 2 For every integer n 0:
Theorem 3 For every integer n 0:
Theorem 4 For every integer n 0:
Theorem 5 For every integer n 0:
Theorem 6 For every integer n 0:
Theorem 7 For every integer n0:
Theorem 8 For every integer n 0:
Theorem 9 For every integer n 0:
Theorem 10 For every integer n 0:
Theorem 11 For every integer n 0:
Theorem 12 For every integer n 0:
Theorem 13 For every integer n 0:
Theorem 14 For every integer n 0:
Theorem 15 For every integer n 0:
Theorem 16 For every integer n 0:
Theorem 17 For every integer n 0:
Theorem 18 For every integer n 0:
Acknowledgment
We are thankful to referees for their valuable comments.
References
[1]  Benjamin A., Cameron N. and Quinn J.: Fibonacci Determinants A Combinatorial Approach, Fibonacci Quarterly, 3955 (1), 2007, Vol 45. 
 In article  

[2]  BicknellJohnson M. and Spears C. P.:Classes Of Identities For the Generalized Fibonacci number G_{n}= G_{n1 }+ G_{n2}, n ≥ 2. from Matrices with Constantvalued Determinants, Fibonacci Quarterly, 121128 (2), 1996, Vol. 34. 
 In article  

[3]  B. Singh, O. Sikhwal, and S. Bhatnagar, FibonacciLike Sequence and its properties, Int.J. Contemp Math.Sciences, Vol.5, 2010, No.18, 857868. 
 In article  

[4]  Cahill N. and Narayan D.:Fibonacci and Lucas numbers s Tridigonal Matrix Determinants, Fibonacci Quarterly, 216221 (3), 2004, Vol. 42. 
 In article  

[5]  Koshy T.:Fibonacci and Lucas Numbers with Applications, Wiley, 2001. 
 In article  CrossRef 

[6]  Krattenthaler C.: Advanced determinant calculus, Seminaire Lotharingien Combin, Article, b42q, 67, 1999. 
 In article  

[7]  Krattenthaler C.: Advanced determinant calculus: A Complement, Liner Algebra Appl., 68166. 
 In article  

[8]  Macfarlane A. J.: Use of Determinants to Present Identities Involving Fiboncci and Related Numbers, Fibonacci Quarterly, 687648(1), 2010, Vol. 48. 
 In article  

[9]  Spivey M. Z.: Fibonacci Identities via the Determinant sum property, College Mathematics Journal, 286289 (4), 2006, Vol. 37. 
 In article  
