Arithmetic Sequences without Arithmetic Operations

The generation of arithmetic sequences involves arithmetic operations. However, is it possible to generate such sequences without being subject to any arithmetic or related operations, all by just hand? The answer may be negative, as the very rule defining these sequences itself relies on arithmetic operations. Nonetheless, this paper presents a few results demonstrating that the exact sequences of $an$, where, a ∈ \ 2,3,⋯,9,10\ and n ∈ N ∪ \0\, can indeed be generated up to any desired number of terms without relying on any arithmetic operations and others derived from such. This is done by the formation of a specialized table that leverages numerical patterns and the notion of concatenation.