Curious Generalized Fibonacci Numbers

A generalization of the well-known Fibonacci sequence is the k−Fibonacci sequence whose first k terms are 0,…,0,1 and each term afterwards is the sum of the preceding k terms. In this paper, we find all k-Fibonacci numbers that are curious numbers (i.e., numbers whose base ten representation have the form a⋯ab⋯ba⋯a). This work continues and extends the prior result of Trojovský, who found all Fibonacci numbers with a prescribed block of digits, and the result of Alahmadi et al., who searched for k-Fibonacci numbers, which are concatenation of two repdigits.

On some 3 × 3 dimensional matrices associated with generalized Fibonacci numbers

In this work, it is presented a procedure to find some 3 × 3 dimensional matrices whose integer powers can be characterized by generalized Fibonacci numbers. Moreover, some numerical examples are given to exemplify the procedure established.

Generalized Fibonacci Numbers with Indices in Arithmetic Progression and Sum of Their Squares: The Sum Formula ∑nk=0 xkW2mk+j

In this paper, closed forms of the sum formulas ∑n k=0 xkWmk 2 +j for generalized Fibonacci numbers are presented. As special cases, we give sum formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers. We present the proofs to indicate how these formulas, in general, were discovered. Of course, all the listed formulas may be proved by induction, but that method of proof gives no clue about their discovery.

k-generalized Fibonacci numbers which are concatenations of two repdigits

We show that the k-generalized Fibonacci numbers that are concatenations of two repdigits have at most four digits.

Some Properties of Generalized Fibonacci Numbers: Identities, Recurrence Properties and Closed Forms of the Sum Formulas ∑nk=0 xkWmk+j

In this paper, closed forms of the summation formulas ∑nk=0 xkWmk+j for generalized Fibonacci numbers are presented. As special cases, we give summation formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers. We present the proofs to indicate how these formulas, in general, were discovered. Of course, all the listed formulas may be proved by induction, but that method of proof gives no clue about their discovery. Moreover, we give some identities and recurrence properties of generalized Fibonacci sequence.

On the alternating sums of reciprocal generalized Fibonacci numbers

In this paper, we consider finite alternating sums derived from the generalized Fibonacci numbers [Formula: see text] [Formula: see text] and [Formula: see text], where [Formula: see text] and [Formula: see text] are positive integers with [Formula: see text], [Formula: see text]. Applying the greatest integer function to these sums, we obtain some equalities involving the generalized Fibonacci numbers.