Apparently the code below discovers square numbers by virtue of always having an odd number of improper factors (a mathematical fact with which I'm fully on board).
Please, please please could someone explain what is happening with it!! I'm no stranger to computer code but this is just not making sense to me!
LET X(J) = 0
LET J = J+1
LET J =J+1
UNTIL J =n+1