An integer sequence (xn)n≥0 is said to be Fibonacci-like if it satisfies the binary recurrence relation xn = xn−1 + xn−2, n ≥ 2. We construct a new type of Fibonacci-like sequence of composite numbers. 1 The problem and previous results In this paper we consider Fibonacci-like sequences, that is, sequences (xn) ∞ n=0 satisfying the binary recurrence relation xn = xn−1 + xn−2, n ≥ 2. (1)

In this paper we obtain formulas for certain sums of products involving multinomial coefficients and Fibonacci numbers. The sums studied here may be regarded as generalizations of the binomial transform of the sequence comprising the even-numbered terms of the Fibonacci sequence. The general formulas, involving both Fibonacci and Lucas numbers, give rise to infinite sequences that are parameter...

For a graph G, Fibonacci Number of G is defined as the number of subsets of V (G) in which no two vertices are adjacent in G. In this paper, we first investigate the orderings of two classes of trees by their Fibonacci numbers. Using these orderings, we determine the unique tree with the second, and respectively the third smallest Fibonacci number among all trees with n vertices.

ABSTRACT Recently Holliday and Komatsu extended the results of Ohtsuka and Nakamura on reciprocal sums of Fibonacci numbers to reciprocal sums of generalized Fibonacci numbers. The aim of this work is to give similar results for the alternating sums of reciprocals of the generalized Fibonacci numbers with indices in arithmetic progression. Finally we note our generalizations of some results of ...

Abstract: In this study, we present a numerical scheme to solve the telegraph equation by using Fibonacci polynomials. This method is based on the Fibonacci collocation method which transforms the equation into a matrix equation, and the unknown of this equation is a Fibonacci coefficients matrix. Some numerical examples with comparisons are included to demonstrate the validity and applicabilit...

The Fibonacci recurrence of the critical orbit appeared in the work of Branner and Hubbard on complex cubic polynomials [BH, §12] and in Yoccoz's work [Yl, Y2] on quadratic ones, as the "worst" pattern of recurrence. On the other hand, a real quadratic Fibonacci map was suggested by Hofbauer and Keller [HK] as a possible candidate for a map having a "wild" attractor (that is, a set A which is t...

Many properties of special polynomials, such as recurrence relations, sum formulas, and symmetric have been studied in the literature with help generating functions their functional equations. In this paper, using (p,q)–Fibonacci (p,q)–Lucas Changhee numbers, we define (p,q)–Fibonacci–Changhee polynomials (p,q)–Lucas–Changhee respectively. We obtain some important identities relations these new...

A stochastic Lyapunov function was used to assess the convergence velocity of a simple evolutionary algorithm with self-adaptation, which searches for a maximum of a “fitness” function. This algorithm uses two types of parameters: “fitness” parameters belonging to the domain of the function, and strategy parameters, which control changes of fitness parameters. It was shown that the convergence ...