2000 character limit reached
Partial sums of the Gibonacci sequence
Published 8 Sep 2021 in math.CO and math.NT | (2109.03534v1)
Abstract: Recently, Chu studied some properties of the partial sums of the sequence $Pk(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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.