𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Incomplete Fibonacci and Lucas -numbers

✍ Scribed by Dursun Tasci; Mirac Cetin Firengiz

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
278 KB
Volume
52
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Binary Lucas and Fibonacci Polynomials,
Binary Lucas and Fibonacci Polynomials, I
✍ GΓΌnther Frei πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 994 KB

## Binary Lucas and Fibonacci Polynomials, I By GUNTHER FREI of Ste-Boy, Qu8bec (Canada) (Eingegungen urn 12.6.1979) (ii) Prei, Binary Lucas and Fibonacci Polynomials ( i i ) riiris similarly, that is If we set Definition 2.4. For any n 2 0, 85 then the polynoinials ill, and G,, are well defined f

Fibonacci numbers and words
Fibonacci numbers and words
✍ Giuseppe Pirillo πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 521 KB

Let 4> be the golden ratio (xf5 + 1)/2, f, the nth Fibonacci finite word and f the Fibonacci infinite word. Let r be a rational number greater than (2 + q~)/2 and u a non-empty word. If u" is a factor of f, then there exists n ~> 1 such that u is a conjugate of f. and, moreover, each occurrence of u

Nondecreasing Dyck paths and q-Fibonacci
Nondecreasing Dyck paths and q-Fibonacci numbers
✍ E. Barcucci; A. Del Lungo; S. Fezzi; R. Pinzani πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 306 KB

In this paper, we introduce a subclass of the Dyck paths (Delest and Viennot, 1984) called nondecreasing Dyck paths which are enumerated by the Fibonacci numbers having odd indexes. We then use two different methods to enumerate these paths according to various parameters. By the first one, used in