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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308762 Sum of the third largest parts of the partitions of n into 4 squarefree parts. 4
 0, 0, 0, 0, 1, 1, 2, 3, 6, 6, 10, 11, 16, 16, 22, 23, 35, 38, 51, 57, 75, 76, 94, 99, 125, 128, 158, 162, 208, 209, 242, 251, 311, 317, 376, 390, 467, 478, 548, 553, 672, 682, 784, 801, 957, 957, 1096, 1101, 1284, 1294, 1471, 1469, 1725, 1717, 1917, 1918 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 LINKS Table of n, a(n) for n=0..55. Index entries for sequences related to partitions FORMULA a(n) = Sum_{k=1..floor(n/4)} Sum_{j=k..floor((n-k)/3)} Sum_{i=j..floor((n-j-k)/2)} mu(k)^2 * mu(j)^2 * mu(i)^2 * mu(n-i-j-k)^2 * j, where mu is the Möbius function (A008683). a(n) = A308783(n) - A308768(n) - A308769(n) - A308770(n). MATHEMATICA Table[Sum[Sum[Sum[j * MoebiusMu[k]^2*MoebiusMu[j]^2*MoebiusMu[i]^2* MoebiusMu[n - i - j - k]^2, {i, j, Floor[(n - j - k)/2]}], {j, k, Floor[(n - k)/3]}], {k, Floor[n/4]}], {n, 0, 100}] CROSSREFS Cf. A008683, A308767, A308768, A308769, A308770, A308783. Sequence in context: A185423 A144583 A328565 * A155215 A363075 A119319 Adjacent sequences: A308759 A308760 A308761 * A308763 A308764 A308765 KEYWORD nonn AUTHOR Wesley Ivan Hurt, Jun 23 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.

Last modified December 10 09:04 EST 2023. Contains 367701 sequences. (Running on oeis4.)