|
Search: id:A100056
|
|
| |
|
| 1, 3, 7, 10, 16, 22, 27, 37, 47, 57, 67, 75, 91, 107, 123, 139, 155, 171, 187, 200, 226, 252, 299, 304
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
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.
|
|
FORMULA
|
a(n) = sum, (abs. values) of difference row of p(n), A054065.
|
|
EXAMPLE
|
a(4) = 7 since p(4) of A054065 = 2 4 1 3. Finite difference row (abs. values) of p(4) = 2 3 2 = 7.
|
|
CROSSREFS
|
Cf. A100057, clock-oriented analogous sequence.
Sequence in context: A121016 A088636 A114113 this_sequence A128223 A111244 A022120
Adjacent sequences: A100053 A100054 A100055 this_sequence A100057 A100058 A100059
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 31 2004
|
|
EXTENSIONS
|
Warning: This entry has not been edited and may contain errors. It is included on a provisional basis in the hope that some reader will edit it. - njas
|
|
|
Search completed in 0.002 seconds
|
