Return to Answer

#Update#

This is a placeholder, as I have no access to my computer for a few days, but outlines rough sketch of idea:

Illustrated as a clock with $1$ at the top for $n=24$ power$=2,$ this is a far more systematic way to think about it:

grouping sum-pairs by square $\leq 48.$ The superimposition shows all possible paths with one remaining odd "leg". There is therefore no Eulerian circuit (or trail) for $n=24$ power$=2.$

As long as there is at least two adjoining points for all but $2$ points, there will be an Eulerian trail. If all points have at least two adjoining points, it is likely there will be an Eulerian circuit.

It is highly likely then, that over a certain $n$ for each power will guarantee at least one Eulerian trail.

It is highly likely then (and not too difficult to prove, I should have thought), that over a certain $n$ for each power will guarantee at least one Eulerian trail.

It is highly likely then, that over a certain $n$ for each power will guarantee at least one Eulerian trail.

#Update#

This is a placeholder, as I have no access to my computer for a few days, but outlines rough sketch of idea:

Illustrated as a clock with $1$ at the top for $n=24$ power$=2,$ this is a far more systematic way to think about it:

grouping sum-pairs by square $\leq 48.$ The superimposition shows all possible paths with one remaining odd "leg". There is therefore no Eulerian circuit (or trail) for $n=24$ power$=2.$

As long as there is at least two adjoining points for all but $2$ points, there will be an Eulerian trail. If all points have at least two adjoining points, it is likely there will be an Eulerian circuit.

It is highly likely then (and not too difficult to prove, I should have thought), that over a certain $n$ for each power will guarantee at least one Eulerian trail.