What is the name of the conjecture related to what Matt Parker has called "The Square-Sum Problem"? I read a book called Things to Make and Do in the Fourth Dimension, written by Australian mathe-matician and comedian, Matt Parker. In one part of the book, I remember him explaining about a conjecture such that for all $n\geqslant 89$, you can arrange the elements of the set $\{1, 2,\ldots,n\}$ in a certain way where each adjacent pair of elements sums to a squared number. For example, let $n = 17$. Al-though $17<89$, below is a good example to demonstrate what I mean:
We have the set $\{1, 2, 3,\ldots, 17\}$ which can also be written as $\mathbb{N}_{\leqslant 17}$. How can we order each number in a certain way such that every adjacent pair of numbers in the ordered sequence add up to a squa-red number? Well, we order it like so:


Let $S_{17} = [\ldots]$ be our sequence that orders the elements from $\{1, 2, 3,\ldots, 17\}$ in a certain way as mentioned in the foregoing then, $$S_{17} := \big[17, 8, 1, 15, 10, 6, 3, 13, 12, 4, 5, 11, 14, 2, 7, 9, 16\big].$$ Here, $17 + 8 = 5^2$, $8 + 1 = 3^2$, $1 + 15 = 4^2,\ldots$


The sequence in the sandbox above is a special case where it has $17$ elements and begins with $17$. Take the sequence $S_{16}$ then this sequence ends with $16$. In fact, it is exactly the same as $S_{17}$ except it does not start from $17$, but $8$ instead. However, the sequence $S_{18}$ does not exist, and there are many sequences with this property that do not exist. The conjecture is interesting because if true, it will prove that there are only finitely  many sequences $S_n$ that do not exist, also proving the contrapo-sitive.
I did some research and it seems like this is true for $89\leqslant n \leqslant 300$ thus far, but I do not know the name of this conjecture. Does it even have a name? I also haven’t stumbled across any attempts of proving this conjecture. Can it be done? I guess that is two questions, then.
Thank you in advance.
 A: On the OEIS sequence for counterexamples, R.K.Guy claims that "the problem originated (for n = 15) with Bernardo Recamán Santos of Colombia.", but does not give a name for the problem.
On a Numberphile episode, Matt Parker himself has given this problem the name "The Square-Sum Problem".
I have not evaluated the proof myself, but there is what amounts to a program and description (a preprint?) purporting to prove this conjecture at this mersenneforum post (and the preceding posts help for context) by Robert Gerbicz.
For the same problem but requiring the numbers to make a loop (so that the first and last numbers sum to a square as well), the numbers of solutions for small $n$ are documented in OEIS A071984. Guy attributed that version of the problem to Joe Kisenwether. In fact, the above post by Robert Gerbicz handles the corresponding conjecture for loops (loops exist for all $n\ge32$) as well.
There is a related MSE question and corresponding MO question about perfect powers with or without loops in more generality.
