Pell and associated Pell braid sequences as GCDs of sums of k consecutive Pell, balancing, and related numbers
Abstract
We consider the greatest common divisor (GCD) of all sums of k consecutive terms of a sequence (Sn)n≥ 0 where the terms Sn come from exactly one of following six well-known sequences' terms: Pell Pn, associated Pell Qn, balancing Bn, Lucas-balancing Cn, cobalancing bn, and Lucas-cobalancing cn numbers. For each of the six GCDs, we provide closed forms dependent on k. Moreover, each of these closed forms can be realized as braid sequences of Pell and associated Pell numbers in an intriguing manner. We end with partial results on GCDs of sums of squared terms and open questions.
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.