On the Sum of the Sixth Powers of Fibonacci Numbers
Abstract
Let (Gk)k∈ Z be any sequence obeying the recurrence relation of the Fibonacci numbers. We derive formulas for Σj=1nGj + t6 and Σj=1n(-1)j - 1Gj + t5(Gj + t - 1 + Gj + t + 1), thereby extending the results of Ohtsuka and Nakamura who found simple formulas for Σj=1nFj6 and Σj=1nLj6, where Fk and Lk are the kth Fibonacci and Lucas numbers. We also evaluate Σj = 1n Gj + t3 Gj + t + 13 and Σj = 1n Gj + t - 12 Gj + t Gj + t + 1 Gj + t + 22 , of which the results of Treeby are particular cases.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.