Continued Fraction Counting Problem The house of my friend is in a long street, numbered on this side one, two, three, and so on.  All the numbers on one side of him added up exactly the same as all the numbers on the other side of him. 
There is more than fifty houses on that side of the street, but not so many as five hundred. If we find the number of the house where my friend lives, the problem had one solution — house no. 204 in a street of 288 houses, i.e. 
1+2+ ... 203 = 205 + 206+ . . . 288. 
But without the 50-to-500 house constraint, there are other solutions. For example, on an eight-house street, no. 6 would be the answer: 
1 + 2 + 3 + 4 + 5 =  7 + 8.
Ramanujan is reported to have discovered a continued fraction comprising of a single expression with all such correct answers.  What is the continued fraction, and how can it be found?

Also, if we take the house numbers $$ x_0 = 0,  $$ 
$$ x_1 = 1,  $$
$$ x_2 = 6,  $$
$$ x_3 = 35,  $$
$$ x_4 = 204, $$
$$ x_5 = 1189,  $$
we have a simple recurrence
$$ \color{magenta}{ x_{n+2} = 6 x_{n+1} - x_n }$$
which follows by Cayley-Hamilton from the generator of the oriented automorphism group of $u^2 - 8 v^2.$
If $y_n$ is the number of houses on the street, so $y_n \in \{1,8,49,288,1681, \ldots \}$ then 
$$ \color{magenta}{ y_{n+2} = 6 y_{n+1} - y_n + 2 }$$
The part about the automorphism group comes down to this single identity involving a linear map,
$$ (3u+8v)^2 - 8(u+3v)^2 = u^2 - 8 v^2  $$
