Search

Recently, Chu studied some properties of the partial sums of the sequence $P^k(F_n)$, where $P(F_n)=\big(\sum_{i=1}^nF_i\big)_{n\geq1}$ and $(F_n)_{n\geq1}$ is the Fibonacci sequence, and gave its combinatorial interpretation. We generalize those results, introduce colored Schreier sets, and give another equivalent combinatorial interpretation by means of lattice path., Comment: 6 pages, 1 figure

We introduce a new four-parameters sequence that simultaneously generalizes some well-known integer sequences, including Fibonacci, Padovan, Jacobsthatl, Pell, and Lucas numbers. Combinatorial interpretations are discussed and many identities for this general sequence are derived. As a consequence, a number of identities for Fibonacci, Lucas, Pell, Jacobsthal, Padovan, and Narayana numbers as well as some of their generalizations are obtained. We also present the Cassini formula for the new sequence.

Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative both vanish at $1$, and will be an integer polynomial after multiplying it by a product of the first consecutive Lucas numbers of odd order. This presents an affirmative answer to a conjecture of Melham., Comment: 15pages