login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A340247
Sum of the third largest parts r of the partitions of n into 4 parts q,r,s,t such that 1 <= q <= r <= s <= t and q + r + s > t.
3
0, 0, 0, 1, 1, 1, 3, 5, 7, 10, 15, 19, 28, 33, 46, 57, 75, 84, 113, 129, 164, 184, 232, 256, 319, 347, 425, 466, 561, 601, 723, 777, 918, 981, 1152, 1224, 1428, 1509, 1746, 1849, 2122, 2227, 2550, 2678, 3040, 3184, 3600, 3760, 4234, 4410, 4942, 5151, 5745, 5961, 6635
OFFSET
1,7
FORMULA
a(n) = Sum_{k=1..floor(n/4)} Sum_{j=k..floor((n-k)/3)} Sum_{i=j..floor((n-j-k)/2)} sign(floor((i+k+j)/(n-i-j-k+1))) * j.
MATHEMATICA
Table[Sum[Sum[Sum[j*Sign[Floor[(i + k + j)/(n - i - j - k + 1)]], {i, j, Floor[(n - j - k)/2]}], {j, k, Floor[(n - k)/3]}], {k, Floor[n/4]}], {n, 60}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jan 01 2021
STATUS
approved