OMARWA Computational Verification Dataset: Period Tables, Digital Root Maps, and GCD Matrices

Independent computational verification of all principal theorems in the OMARWA sequence theory (Tk = 6·2k + 1, OEIS A004119). Contains: Period table: P(m) for m = 1..1000 (OMARWA modular period) Digital root map: DR(Tk) and residues mod 3/9/11/27/37 for k = 0..100 GCD matrix: gcd(Ti, Tj) for 0 ≤ i,j < 50 Fractal period laws: P(3n) and P(11n) with predictions Palindrome structure: Tk mod 11 over one super-period L=30 Super-period & Product Theorem: L = lcm(P(9), P(11)) = 30 All data is reproducible via the included Python script (zenodo_dataset_generator.py). Epistemic class: [D] — computational verification only, not a substitute for formal proofs. Related: Software DOI 10.5281/zenodo.19024222, Preprint DOI 10.5281/zenodo.19025172.