Skip to main content
2 of 2
added 181 characters in body; added 12 characters in body
Zev Chonoles
  • 6.8k
  • 4
  • 54
  • 92

My 2 cents (ha ha): perhaps the approach is to show that the power of 2 dividing $2+\sum_{i=1}^{n-1}a_i^2$ is eventually less than the power of 2 in $n$, and that this somehow involves looking at $a_{2^n}$. I'll keep playing with it for a bit.

(inspired by this kind of argument that the harmonic numbers are not integers)

Zev Chonoles
  • 6.8k
  • 4
  • 54
  • 92