Problem #4
This month we have four related problems.
 Arrange the integers from 1 to 15 inclusive in a row so that the sum
of any two adjacent elements is a perfect square.

What is the smallest integer n such that the integers from 1 to
n inclusive can be arranged in a circle so that the sum of any
two adjacent elements is a perfect square?

What is the smallest integer n such that the integers from 1 to
n inclusive can be arranged in a row so that the sum of any
three adjacent elements is a perfect square?
What if we ask that they be arranged in a circle?
No solution to the last question has been submitted.