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!)
A309482 Sum of the squarefree parts of the partitions of n into 7 parts. 8
0, 0, 0, 0, 0, 0, 0, 7, 8, 18, 26, 51, 76, 127, 178, 262, 363, 524, 687, 962, 1249, 1670, 2136, 2791, 3499, 4501, 5569, 7019, 8608, 10680, 12915, 15823, 18992, 22937, 27279, 32640, 38466, 45618, 53378, 62714, 72950, 85086, 98275, 113915, 130889, 150703 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
FORMULA
a(n) = Sum_{o=1..floor(n/7)} Sum_{m=o..floor((n-o)/6)} Sum_{l=m..floor((n-m-o)/5)} Sum_{k=l..floor((n-l-m-o)/4)} Sum_{j=k..floor((n-k-l-m-o)/3)} Sum_{i=j..floor((n-j-k-l-m-o)/2)} (i * mu(i)^2 + j * mu(j)^2 + k * mu(k)^2 + l * mu(l)^2 + m * mu(m)^2 + o * mu(o)^2 + (n-i-j-k-l-m-o) * mu(n-i-j-k-l-m-o)^2), where mu is the Möbius function (A008683).
MATHEMATICA
Table[Sum[Sum[Sum[Sum[Sum[Sum[(i * MoebiusMu[i]^2 + j * MoebiusMu[j]^2 + k * MoebiusMu[k]^2 + l * MoebiusMu[l]^2 + m * MoebiusMu[m]^2 + o * MoebiusMu[o]^2 + (n - i - j - k - l - m - o) * MoebiusMu[n - i - j - k - l - m - o]^2), {i, j, Floor[(n - j - k - l - m - o)/2]}], {j, k, Floor[(n - k - l - m - o)/3]}], {k, l, Floor[(n - l - m - o)/4]}], {l, m, Floor[(n - m - o)/5]}], {m, o, Floor[(n - o)/6]}], {o, Floor[n/7]}], {n, 0, 50}]
CROSSREFS
Sequence in context: A308953 A143504 A322636 * A308926 A152043 A181585
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Aug 04 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 July 1 13:20 EDT 2024. Contains 373917 sequences. (Running on oeis4.)