OFFSET
1,2
COMMENTS
From Andrew Howroyd, Sep 16 2019: (Start)
Canonical order means each partition is sorted in descending order of part size and then the partitions are listed in lexicographic order.
a(n) is even since for parts that are not self-dual the distance between a part and its dual is counted twice, and for parts that are self-dual the distance is zero. (End)
EXAMPLE
a(4) = 12 = sum of {1,5},{2,4},{3,3},{4,2},{5,1} = 4 + 2 + 0 + 2 + 4.
From Andrew Howroyd, Sep 16 2019: (Start)
Case n = 4: The partitions of 4 in canonical order are:
1) [1,1,1,1]
2) [2,1,1]
3) [2,2]
4) [3,1]
5) [4]
Partitions [1,1,1,1] and [4] are dual, partitions [2,1,1] and [3,1] are dual and partition [2,2] is self-dual.
Summing the distance between each element and its dual gives:
a(4) = |1-5| + |2-4| + |3-3| + |4-2| + |5-1| = 12.
(End)
CROSSREFS
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
a(31)-a(36) from Andrew Howroyd, Sep 16 2019
STATUS
approved