The Recaman sequence is an example of computational irreducibility — there is no closed form, no shortcut. It’s deterministic but not predictable