Ostrowski numeration (source code)

= Ostrowski numeration
{c}

Fix an <irrational number> $\alpha=[0;a_1,a_2,\ldots]$ and let $q_k$ be its <convergent denominators>, with $q_{-1}=0,q_0=1$. <Ostrowski numeration> writes each <nonnegative integer> uniquely as a finite sum $N=\sum_{k\ge0}b_{k+1}q_k$, subject to $0\le b_1<a_1$, $0\le b_{k+1}\le a_{k+1}$ for $k\ge1$, and $b_{k+1}=a_{k+1}\Rightarrow b_k=0$.

The digit restrictions remove the ambiguities caused by $q_{k+1}=a_{k+1}q_k+q_{k-1}$. For $\alpha=(\sqrt5-1)/2$, all <partial quotients> equal one, so this becomes the representation by nonconsecutive <Fibonacci numbers>, with the duplicate initial weight removed. The numeration is useful for linking <integer> expansions to <irrational rotations> and <Sturmian words>.