SCHWEITZER 1976 Problem 1

Assume that $R$ , a recursive, binary relation on $\mathbb{N}$ (the set of natural numbers), orders $\mathbb{N}$ into type $\omega$ . Show that if $f(n)$ is the $n$ th element of this order, then $f$ is not necessarily recursive.

L. Posa