login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036045 Sum of distances between dual pairs of partitions of n for the canonical order. 11
0, 2, 4, 12, 24, 60, 110, 238, 436, 860, 1516, 2848, 4874, 8666, 14664, 25120, 41342, 69178, 111596, 181890, 289170, 461086, 720944, 1131358, 1743016, 2689332, 4094090, 6228298, 9364440, 14072828, 20926402, 31080270, 45767490, 67255096, 98095260, 142805322 (list; graph; refs; listen; history; text; internal format)
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)
LINKS
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
Sequence in context: A045687 A233411 A057422 * A331392 A100538 A303794
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
a(31)-a(36) from Andrew Howroyd, Sep 16 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 16:22 EDT 2024. Contains 371780 sequences. (Running on oeis4.)