Statistical Properties of the Rooted-Tree Encoding of $\mathbb{N}$

Pierluigi Contucci, Claudio Giberti, Godwin Osabutey +1

We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This…