A Computational Interpretation of the Jacobsthal Model of the 3n + 1 Problem

The present work provides a computational realisation of the theoretical constructions introduced by P. Kosobutskyy and D. Mailland in their Jacobsthal-based interpretation of the Collatz problem. In that framework, the set of natural numbers is viewed as a family of binary-rooted sequences (θ • 2 n ) indexed by odd parameters θ, each sequence corresponding to a branch of the transformation graph. This representation shows a modular and hierarchical structure of the 3n + 1 dynamics, where every integer belongs to a residue family.