a(n) is the shortest possible n-th-power loop where an n-th-power loop of length m > 1 is a circular permutation of the numbers 1 to m such that the sum of any two consecutive numbers is a perfect n-th power.

A115418

a(n) is the shortest possible n-th-power loop where an n-th-power loop of length m > 1 is a circular permutation of the numbers 1 to m such that the sum of any two consecutive numbers is a perfect n-th power.