OMARWA Computational Verification Dataset: Period Tables, Digital Root Maps, and GCD Matrices
收藏Zenodo2026-03-15 更新2026-05-26 收录
下载链接：
https://zenodo.org/doi/10.5281/zenodo.19028938
下载链接
链接失效反馈官方服务：
资源简介：
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.
提供机构：
Zenodo创建时间：
2026-03-15
