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”).
proposed
approved
editing
proposed
Table[Sum[Sum[Sum[Sum[Sum[m*MoebiusMu[i]^2*MoebiusMu[j]^2*MoebiusMu[k]^2* MoebiusMu[l]^2*MoebiusMu[m]^2*MoebiusMu[n - i - j - k - l - m]^2, {i, j, Floor[(n - j - k - l - m)/2]}], {j, k, Floor[(n - k - l - m)/3]}], {k, l, Floor[(n - l - m)/4]}], {l, m, Floor[(n - m)/5]}], {m, Floor[n/6]}], {n, 0, 10050}]
allocated for Wesley Ivan HurtSum of the smallest parts in the partitions of n into 6 squarefree parts.
0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 4, 5, 9, 9, 12, 15, 21, 23, 31, 32, 45, 50, 61, 66, 87, 94, 114, 123, 154, 165, 199, 212, 261, 276, 323, 345, 418, 438, 507, 538, 637, 672, 771, 810, 947, 999, 1130, 1192, 1381, 1445, 1625, 1716, 1955, 2045, 2289, 2399, 2720
0,9
<a href="/index/Par#part">Index entries for sequences related to partitions</a>
a(n) = Sum_{m=1..floor(n/6)} Sum_{l=m..floor((n-m)/5)} Sum_{k=l..floor((n-l-m)/4)} Sum_{j=k..floor((n-k-l-m)/3)} Sum_{i=j..floor((n-j-k-l-m)/2)} mu(m)^2 * mu(l)^2 * mu(k)^2 * mu(j)^2 * mu(i)^2 * mu(n-i-k-j-l-m)^2 * m, where mu is the Möbius function (A008683).
Table[Sum[Sum[Sum[Sum[Sum[m*MoebiusMu[i]^2*MoebiusMu[j]^2*MoebiusMu[k]^2* MoebiusMu[l]^2*MoebiusMu[m]^2*MoebiusMu[n - i - j - k - l - m]^2, {i, j, Floor[(n - j - k - l - m)/2]}], {j, k, Floor[(n - k - l - m)/3]}], {k, l, Floor[(n - l - m)/4]}], {l, m, Floor[(n - m)/5]}], {m, Floor[n/6]}], {n, 0, 100}]
allocated
nonn
Wesley Ivan Hurt, Jun 29 2019
approved
editing
allocated for Wesley Ivan Hurt
recycled
allocated
recycled
approved