Results 101 to 110 of about 395,880 (199)
Polynomial generalizations of the Pell sequences and the Fibonacci sequence
, 2015 In this paper we present polynomial generalizations for the Pell sequence and the Fibonacci sequence together with formulas for those sequences.
Ivkovic, M, Santos, JPO
core
Sums of certain products of fibonacci & Lucas numbers-part III [PDF]
, 2017 For the Fibonacci numbers, the summation formula σnk=1 Fk2=FnFn+1is well-known. Its charm lies in the fact that the right side is a product of terms from the Fibonacci sequence.
Melham, RS
core
Variants of the Filbert Matrix
, 2013 A variation of the Filbert matrix from [1] is introduced, which has one additional Fibonacci factor in the numerator. We also introduce its Lucas counterpart by taking Lucas numbers instead of Fibonacci numbers in a similar manner.
Kılıç, Emrah, Prodinger, Helmut
core
The Divine Proportion: Origins and Usage in Plastic Surgery. [PDF]
Plast Reconstr Surg Glob Open, 2021 Hwang K, Park CY.
europepmc +1 more source
A long and winding road: My personal journey to oxytocin with no return. [PDF]
Compr Psychoneuroendocrinol, 2023 Marazziti D.
europepmc +1 more source
Journal of Advances in Mathematics and Computer ScienceThe objective of this study is to derive explicit closed-form solutions for second-order nonhomogeneous linear recurrence relations with polynomial inputs, formulated in terms of generalized Fibonacci-type and generalized Pell-type sequences. A central aspect of the framework is the restriction to the non-resonant case r = 0, which ensures that the ...
openaire +1 more source
Aplicações da sequência de Fibonacci
, 2016 Esta coleção é formada por recursos audiovisuais que tratam do assunto relacionado ao conteúdo de Sequência de Fibonacci. A sequência de Fibonacci é uma sequência infinita de números descrita por Leonardo de Pisa, conhecido como Fibonacci.
Roman, Patrícia +8 more
core +2 more sources
Determinants of Toeplitz–Hessenberg Matrices with Generalized Leonardo Number Entries
Annales Mathematicae SilesianaeLet un = un(k) denote the generalized Leonardo number defined recursively by un = un−1 + un−2 + k for n ≥ 2, where u0 = u1 = 1. Terms of the sequence un(1) are referred to simply as Leonardo numbers.
Goy Taras, Shattuck Mark
doaj +1 more source
An image processing of a Raphael's portrait of Leonardo [PDF]
, 2011 In one of his paintings, the School of Athens, Raphael is depicting Leonardo da Vinci as the philosopher Plato. Some image processing tools can help us in comparing this portrait with two Leonardo's portraits, considered as self ...
Sparavigna, Amelia Carolina
core
Fibonacci’s Liber Abaci: A Translation into English of Leonardo Pisano’s Book of Calculation
Aestimatio: Critical Reviews in the History of Science, 2015 Laurence E. Sigler (book author) +1 more
openaire +3 more sources