|
|
A231074
|
|
The number of possible ways to arrange the sums x_i + x_j (1 <= i < j <= n) of the items x_1 < x_2 <...< x_n in nondecreasing order.
|
|
2
|
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
Every possible ordering of sums provides a way of placing 1,2,...,n(n+1)/2 in a triangular array such that both rows and columns are increasing, but the reverse is generally not true.
|
|
LINKS
|
|
|
EXAMPLE
|
Let a < b < c < d. There are two possible ways to arrange the sums in nondecreasing order:
1) a+b <= a+c <= a+d <= b+c <= b+d <= c+d, (for instance, a = 1, b = 3, c = 4, d = 5);
2) a+b <= a+c <= b+c <= a+d <= b+d <= c+d, (for instance, a = 1, b = 2, c = 3, d = 5).
Hence a(4) = 2.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|