Related papers: Partial Sums of the Fibonacci Sequence

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

We will generalize the combinatorial algorithms for computing $\pi(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.

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 consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…

We consider the asymptotics of sums of the form $$ \frac1{F_n^\sigma} \sum_{m = 1}^{F_n-1} \frac{f(m/F_n)}{\left|{\sin(\pi m/F_n)}\right|^\sigma} \frac{f(F_{n-1}m/F_n)}{\left|{\sin(\pi F_{n-1}m/F_n)}\right|^\sigma} $$ where $(F_n)_{n \in…

An integer sequence is called realizable if it is the count of periodic points of some map. The Fibonacci sequence $(F_n)$ does not have this property, and the Fibonacci sequence sampled along the squares $(F_{n^2})$ also does not have this…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…

In this paper, for the generalized Fibonacci sequence $\left\{W_n\left(a,b,p,q\right)\right\}$, by using elementary methods and techniques, we give the asymptotic estimation values of…

We study sums of powers of Fibonacci and Lucas polynomials of the form $% \sum_{n=0}^{q}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}L_{tsn}^{k}% (x) $, where $s,t,k$ are given natural numbers, together with the corresponding alternating sums…

We consider the amusing sequence of functions $f_n: \mathbb{R} \rightarrow \mathbb{R}$ given by $$ f_n(x) = \sum_{k=1}^{n}{\frac{|\sin{(k \pi x)}|}{k}}.$$ Every rational point is eventually the location of a strict local minimum of $f_n$:…

For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized Fibonacci sequence which starts with $ 0, \ldots, 0, 1 $ ($ k $ terms) and each term afterwards is the sum of the $ k $ preceding terms. In this paper,…

A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…

We study formulas expressing Fibonacci numbers as sums over compositions using free submonoids of the free monoid of compositions with parts 1 and 2.

We define a class of sequences ${a_n}$ by $a_1=a$ and $a_{n+1}=P(a_n)$, where $P(x)$ is a polynomial with real coefficients. We then find out for which values $a$ and for which polynomials $P(x)$ these sequences will be constant after a…

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

Given that $a,b\in\mathbb N$, $c_0,c_1\in\mathbb Z$, $(c_0,c_1)\neq (0,0)$, and a generalized Fibonacci sequence $(s_n)_{n\geq 0}$ where $s_0 = c_0$, $s_1 = c_1$, and $s_{n+1}=as_{n}+bs_{n-1}$ for all positive integers $n$. In this paper,…

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

We study new identities related to the sums of adjacent terms in the Pell sequence, defined by $P_{n} := 2P_{n-1}+P_{n-2}$ for $ n\geq 2$ and $P_{0}=0, P_{1}=1$, and generalize these identities for many similar sequences. We prove that the…

The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…