This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A100056 #5 Mar 30 2012 17:29:19 %S A100056 1,3,7,10,16,22,27,37,47,57,67,75,91,107,123,139,155,171,187,200,226, %T A100056 252,278,304,330,356,382,408,434,460,486,512,533,575,617,659,701,743, %U A100056 785,827,869,911,953,995,1037,1079,1121,1163,1205,1247,1289,1331,1373 %N A100056 Sum of absolute differences of p(n) defined in A054065. %C A100056 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 A100056 a(n) = sum, (abs. values) of difference row of p(n), A054065. %e A100056 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 A100056 Cf. A100057, clock-oriented analogous sequence. %K A100056 nonn %O A100056 2,2 %A A100056 _Gary W. Adamson_, Oct 31 2004 %E A100056 Edited and extended by _Ray Chandler_, Apr 18 2009