TEU Omega Sequences: Internal Divisors and Structural Complexity

This dataset contains two original integer sequences derived from the Theory of Universal Evolution (TEU). Internal Divisors Sequence: a(n)a(n)a(n) = number of internal divisors of nnn (divisors excluding 1 and nnn). Example: a(12)=4a(12)=4a(12)=4. Structural Complexity Sequence: a(n)a(n)a(n) is defined as the structural complexity of n=∏piain=\prod p_i^{a_i}n=∏piai, given bya(n)=Ωbig(n)−1+⌊log⁡2n⌋−max⁡i⌊log⁡2(piai)⌋a(n) = \Omega_{\text{big}}(n) - 1 + \lfloor \log_2 n \rfloor - \max_i \lfloor \log_2(p_i^{a_i}) \rfloora(n)=Ωbig(n)−1+⌊log2n⌋−maxi⌊log2(piai)⌋with the convention a(1)=0a(1)=0a(1)=0 and a(n)=0a(n)=0a(n)=0 iff nnn is prime. Both sequences are novel and intended for submission to the OEIS. The package includes CSV files with the first 500 terms, a README with definitions and examples, and a Python generator script for reproducibility.