ON THE k-LUCAS NUMBERS VIA DETERMINENT

  • Lee, Gwang-Yeon (Department of Mathematics, Hanseo University) ;
  • Lee, Yuo-Ho (Department of Internet Information, Daegu Haany University)
  • Received : 2010.04.12
  • Accepted : 2010.06.25
  • Published : 2010.09.30

Abstract

For a positive integer k $\geq$ 2, the k-bonacci sequence {$g^{(k)}_n$} is defined as: $g^{(k)}_1=\cdots=g^{(k)}_{k-2}=0$, $g^{(k)}_{k-1}=g^{(k)}_k=1$ and for n > k $\geq$ 2, $g^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n-2}+{\cdots}+g^{(k)}_{n-k}$. And the k-Lucas sequence {$l^{(k)}_n$} is defined as $l^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n+k-1}$ for $n{\geq}1$. In this paper, we give a representation of nth k-Lucas $l^{(k)}_n$ by using determinant.

Keywords

References

  1. Gwang-Yeon Lee, k-Lucas numbers and associated bipartite graph, Linear Algebra Appl., 320:51-61 (2000). https://doi.org/10.1016/S0024-3795(00)00204-4
  2. Gwang-Yeon Lee, S.-G. Lee and H.-G. Shin, On the k-generalized Fibonacci matrix Qk, Linear Algebra Appl., 251:73-88(1997). https://doi.org/10.1016/0024-3795(95)00553-6
  3. Gwang-Yeon Lee, S.-G. Lee, J.-S. Kim and H.-K. Shin, The Binet formula and representations of k-generalized Fibonacci numbers, The Fibonacci Quarterly, 39(2):158-164(2001).