A304120 a(n) is the least k such that there is a permutation of the positive integers from 1 through k for which every pair of adjacent terms sums to a perfect power with exponent n.
2, 15, 305, 6479
Offset: 1
Examples
a(1) = 2 as the permutation (1, 2) of the integers has the property that the adjacent terms sum to a power of 1. a(2) = 15 as the permutation of the positive integers 1 through 15 [8, 1, 15, 10, 6, 3, 13, 12, 4, 5, 11, 14, 2, 7, 9] has the property that every pair of adjacent terms sums to a power with exponent n = 2 (a square).
Links
- Moritz Firsching, Arranging numbers from 1 to n such that the sum of every two adjacent numbers is a perfect power, MathOverflow.
- Carlos Rivera, Puzzle 311: Sum to a cube
Crossrefs
For n=2, see A090461.
Programs
-
Sage
See MathOverflow link.
Extensions
a(4) from Jordan D Fredette, May 28 2019
Comments