2,2

Conjecture: a(n) provides the maximum sum of difference terms of any permutation of 1 through n. A054065 (or reversals) give the optimal permutations and a(n) gives the sum.

Table of n, a(n) for n=2..54.

a(n) = sum, (abs. values) of difference row of p(n), A054065.

a(4) = 7 since p(4) of A054065 = 2 4 1 3. Finite difference row (abs. values) of p(4) = 2 3 2; sum = 7.

Cf. A100057, clock-oriented analogous sequence.

Sequence in context: A151733 A088636 A114113 * A163714 A307191 A234638

Adjacent sequences: A100053 A100054 A100055 * A100057 A100058 A100059

nonn

Gary W. Adamson, Oct 31 2004

Edited and extended by Ray Chandler, Apr 18 2009

approved