Omega(n) — Arithmetic Law of Simplicity (first 500 terms)

This dataset provides the first 500 terms of the integer sequenceΩ(n)\Omega(n)Ω(n) defined as the number of proper divisors of nnn excluding 1 and nnn (with Ω(1)=0\Omega(1)=0Ω(1)=0).The sequence vanishes on primes (Ω(p)=0\Omega(p)=0Ω(p)=0) and increases with composite structure, offering a discrete arithmetic instantiation of the Arithmetic Law of Simplicity used within the Theory of Universal Evolution (TEU). Contents omega_sequence.txt: first 500 terms (OEIS-style single line). omega_sequence.csv: table with n, Omega(n) for n=1..500n=1..500n=1..500. omega_sequence.py: reproducible Python 3 script (no external dependencies). README.md, CITATION.cff, LICENSE (CC BY 4.0), checksums.sha256, MANIFEST.md. Mathematical noteIf τ(n)\tau(n)τ(n) is the divisor-counting function, then for n>1n>1n>1:Ω(n)=τ(n)−2\Omega(n) = \tau(n) - 2Ω(n)=τ(n)−2, and for primes ppp, τ(p)=2⇒Ω(p)=0\tau(p)=2 \Rightarrow \Omega(p)=0τ(p)=2⇒Ω(p)=0.