Related papers: A Symmetric Algorithm for Hyperharmonic and Fibona…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
Both Fibonacci and Lucas numbers can be described combinatorially in terms of 0-1 strings without consecutive ones. In the present article we explore the occupation numbers as well as the correlations between various positions in the…
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…
We derive the double recurrence $e_n = \frac{1}{2}(a_{n-1}+5b_{n-1}); f_{n} = \frac{1}{2}(a_{n-1}+b_{n-1})$ with $e_0=2;f_0=0$ for the Fibonacci numbers, leading to an extremely simple and fast implementation. Though the recurrence is…
The hybrid numbers were introduced by Ozdemir [9] as a new generalization of complex, dual, and hyperbolic numbers. A hybrid number is defined by $k=a+bi+c\epsilon +dh$, where $a,b,c,d$ are real numbers and $% i,\epsilon ,h$ are operators…
This paper builds on the research initiated by Boyadzhiev, but introduces generalized harmonic numbers, \[ H_n(\alpha)= \sum_{k=1}^n \frac{\alpha^{k}}{k}, \] which enable the derivation of new identities as well as the reformulation of…
In this study, depending on the upper and the lower indices of the hyperharmonic number $h_{n}^{(r)}$, nonlinear recurrence relations are obtained. It is shown that generalized harmonic number and hyperharmonic number can be obtained from…
A positive integer $n$ is called a balancing number if there exists a positive integer $r$ such that $1 + 2 + \cdots + (n-1) = (n+1) + (n+2) + \cdots + (n+r)$. The corresponding value $r$ is known as the balancer of $n$. If $n$ is a…
We evaluate binomial series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and…
By applying the classic telescoping summation formula and its variants to identities involving inverse hyperbolic tangent functions having inverse powers of the golden ratio as arguments and employing subtle properties of the Fibonacci and…
Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…
In this paper, we introduce relations between binomial sums involving (generalized) Fibonacci and Lucas numbers, and different kinds of binomial coefficients. We also present some relations between sums with two and three binomial…
In this article, we present a trick around Fibonacci numbers which can be found in several magic books. It consists in computing quickly the sum of the successive terms of a Fibonacci-like sequence. We give explanations and extensions of…
We present some new linear, quadratic, cubic and quartic binomial Fibonacci, Lucas and Fibonacci--Lucas summation identities.
In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…
In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…
In this paper, we investigated properties of Tribonacci-Lucas polynomials which generalized Tribonacci-Lucas numbers. From this generalization, we also obtain some new algebraic properties on these numbers and polynomials as Binet formula,…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
Motivated by observations of Guillera we generalise the so-called Ramanujan-type supercongruences to a further level in which the sequences of Fibonacci, Lucas, Ap\'ery numbers and their friends all receive a natural appearance.
Let $(F_n)_{n\ge0}$ and $(L_n)_{n\ge0}$ denote the sequences of Fibonacci and Lucas numbers respectively. This paper determines all Lucas numbers that can be represented as base $b$ mixed concatenations of a Fibonacci number and a Lucas…