A Deterministic Symbolic Sequence from Phonetic Letter Encoding: Sublinear Complexity and an LCR near π

We report a deterministic symbolic sequence generated from a single English letter name using a recursive operator on phonetic encodings. The first 2,000 symbols exhibit sublinear factor complexity, zero topological entropy, near-deterministic letter transitions, and a limiting growth ratio close to π. The sequence is shown over a 16-letter alphabet that has been permuted by a fixed 1–1 substitution for staged disclosure. The original mapping and operator are withheld under the EOA staged disclosure policy and can be made available under a signed collaboration agreement. We provide the sequence, its statistics, and open questions. We invite collaboration to identify the underlying substitution or automaton and to explain the observed phenomena.