warning: page of speculation and wondering
In “Euclidean” algorithm form:

And now we put on top not the usual 1/ of a regular CF, but 2/, to cancel the denominator.

And here we have the same fraction as before, so the terms will repeat, i.e.
![Rendered by QuickLaTeX.com \[\sqrt{3}=1+\cfrac{2}{2+\cfrac{2}{2+\cfrac{2}{2+\dots}}}\]](https://www.adamponting.com/wp-content/ql-cache/quicklatex.com-700d34368c04d2e530fa6527a3015245_l3.png)
A formula for nonregular CFs of square roots

Using the formula, and the Euclidean method above:
![Rendered by QuickLaTeX.com \[\sqrt{17}=1+\cfrac{16}{2+\cfrac{16}{2+\cfrac{16}{2+\dots}}}=4+\cfrac{1}{4+\cfrac{1}{4+\dots}}\]](https://www.adamponting.com/wp-content/ql-cache/quicklatex.com-0731a78d2767f06c668462d027d2c1d9_l3.png)
references
CF links
wikipedia
contfrac CF computer
Gosper’s CF arithmetic
Gosper HAKMEM
mathworld
fractional iteration of 1/(1+x)