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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036051 Sum of distances between greatest-part-order and length-order of partitions of n. 2
0, 0, 0, 2, 4, 14, 26, 68, 128, 272, 492, 990, 1718, 3162, 5510, 9706, 16266, 27884, 45702, 76072, 122770, 198814, 314782, 502026, 781326, 1221738, 1878460, 2890834, 4384516, 6659228, 9986558, 14962700, 22213548, 32899640, 48336230, 70912120, 103173604 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..37.

Sean A. Irvine, Java program (github)

CROSSREFS

Cf. A036045-A036056.

Sequence in context: A135113 A050564 A047830 * A115626 A116021 A288154

Adjacent sequences: A036048 A036049 A036050 * A036052 A036053 A036054

KEYWORD

nonn

AUTHOR

Olivier Gérard

EXTENSIONS

More terms from Sean A. Irvine, Oct 20 2020

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 December 2 20:59 EST 2022. Contains 358510 sequences. (Running on oeis4.)