Results 71 to 80 of about 1,029,498 (122)
The First Study of Mersenne--Leonardo Sequence
Communications in Advanced Mathematical SciencesIn this study, we introduce a new class of numbers, referred to as Modified Mersenne--Leonardo numbers. The aim of this paper is to define the Modified Mersenne--Leonardo sequence and investigate some of its properties, including the recurrence relation,
Paula Maria Machado Cruz Catarino +1 more
doaj +1 more source
On the Generalized Order-k Jacobsthal and Jacobtshal-Lucas Numbers
Fundamentals of Contemporary Mathematical SciencesThe classic Jacobsthal numbers were generalized to k sequences of the generalized order-k Jacobsthal numbers and then have been studied by several authors.
Ahmet Daşdemir +2 more
semanticscholar +1 more source
Note on Binet's Inverse Factorial Series for μ(x)
Proceedings of the Edinburgh Mathematical Society, 1924 E. Copson
semanticscholar +1 more source
Completely Monotonic Functions Related to the Gamma Functions [PDF]
, 2005 Chen, Chao-Ping, Qi, Feng
core
Binet’s Formula for the Tribonacci Sequence
The Fibonacci quarterly, 1982 The terms of a recursive sequence are usually defined by a recurrence procedure; that is, any term is the sum of preceding terms. Such a definition might not be entirely satisfactory, because the computation of any term could require the computation of ...
W. R. Spickerman
openalex +2 more sources
Binet’s Formula for the Recursive Sequence of Order K
The Fibonacci quarterly, 1984 The terms of a recursive sequence are usually defined by a recurrence procedure; that is, any term is the sum of preceding terms. Such a definition might not be entirely satisfactory, because the computation of any term could require the computation of ...
W. R. Spickerman, R. N. Joyner
openalex +2 more sources
A Generalization of Binet’s Formula and Some of Its Consequences
The Fibonacci quarterly, 1989 Darío Castellanos
openalex +2 more sources