Friendly Sequences

  • Published 2006

Abstract

A friendly sequence is one in which successive terms differ by one. Since a friendly sequence may be a repeat on which a longer sequence is based, the first and last terms must be friendly so that repeats are friendly. Friendly sequences often make good candidates for threading and treadling sequences. And since they have alternating parity, they are… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics