A Technical Note on an Apparently Unlisted Integer Sequence from Asymmetric Prime–Composite Neighborhoods

This submission presents a technical note on an integer sequence defined using prime–composite asymmetry. For each integer n ≥ 3, the sequence assigns the smallest positive integer k such that n − k is prime and n + k is composite. The repository includes the implementation, generated data, visualizations, and the accompanying manuscript. The work studies the behavior and growth patterns of this sequence using computational experiments. Early observations suggest irregular and possibly unbounded behavior, motivating further exploration in computational number theory.