نتایج جستجو برای: lucas

تعداد نتایج: 4686  

2016
Arzu Coskun Necati Taskara

In this paper, firstly, we introduce the Ql-Generating matrix for the bi-periodic Lucas numbers. Then, by taking into account this matrix representation, we obtain some properties for the bi-periodic Fibonacci and Lucas numbers.

2013
Nurettin IRMAK Murat ALP

In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn} . Also, we investigate relationships between generalized Fibonacci and Lucas sequences.

2014
M. Cetin Firengiz Dursun Tasci Naim Tuglu

We obtain some new formulas for the Fibonacci and Lucas p-numbers, by using the symmetric infinite matrix method. We also give some results for the Fibonacci and Lucas p-numbers by means of the binomial inverse pairing.

Journal: :Applied Mathematics and Computation 2004
Dursun Tasci Emrah Kilic

In this paper we give a new generalization of the Lucas numbers in matrix representation. Also we present a relation between the generalized order-k Lucas sequences and Fibonacci sequences. 2003 Elsevier Inc. All rights reserved.

2006
DURSUN TAŞCI

In this paper we consider the generalized order-k Fibonacci and Lucas numbers. We give the generalized Binet formula, combinatorial representation and some relations involving the generalized order-k Fibonacci and Lucas numbers.

Journal: :Discrete Mathematics & Theoretical Computer Science 2015
Jernej Azarija Sandi Klavzar Jaehun Lee Yoomi Rho

If f is a binary word and d a positive integer, then the generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all the vertices that contain f as a factor, while the generalized Lucas cube Qd( ↽Ð f ) is the graph obtained from Qd by removing all the vertices that have a circulation containing f as a factor. The Fibonacci cube Γd and the Lucas cube Λd are the grap...

2012
Jaroslav Seibert Pavel Trojovský Stanislav Jakubec JAROSLAV SEIBERT

The aim of this paper is to give new results about factorizations of the Fibonacci numbers Fn and the Lucas numbers Ln. These numbers are defined by the second order recurrence relation an+2 = an+1+an with the initial terms F0 = 0, F1 = 1 and L0 = 2, L1 = 1, respectively. Proofs of theorems are done with the help of connections between determinants of tridiagonal matrices and the Fibonacci and ...

2017
D. CRISP W. MORAN A. POLLINGTON P. SHIUE

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید