The following seems to hold for A196 ("Integer part of square root of
n. Or, number of squares <= n. Or, n appears 2n+1 times.").
"For n>0, let n = a_0 = 1 + a_1 + ... + a_k with a_(j+1) = a_j -
floor(sqrt(a_j)). a(n) is the number of runs in {a_1, ..., a_k}."
Can anyone prove this?
-JRB