|
%I #5 Mar 30 2012 17:29:19
%S 1,3,7,10,16,22,27,37,47,57,67,75,91,107,123,139,155,171,187,200,226,
%T 252,278,304,330,356,382,408,434,460,486,512,533,575,617,659,701,743,
%U 785,827,869,911,953,995,1037,1079,1121,1163,1205,1247,1289,1331,1373
%N Sum of absolute differences of p(n) defined in A054065.
%C 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.
%F a(n) = sum, (abs. values) of difference row of p(n), A054065.
%e 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.
%Y Cf. A100057, clock-oriented analogous sequence.
%K nonn
%O 2,2
%A _Gary W. Adamson_, Oct 31 2004
%E Edited and extended by _Ray Chandler_, Apr 18 2009
|
