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”).

A294248
Number of partitions of 2n into two distinct squarefree parts.
2
0, 1, 1, 3, 1, 3, 2, 5, 4, 5, 4, 7, 4, 6, 4, 8, 6, 11, 6, 11, 7, 12, 7, 13, 8, 13, 10, 13, 10, 14, 10, 15, 10, 17, 12, 21, 13, 19, 12, 20, 12, 21, 13, 23, 17, 22, 16, 24, 17, 25, 17, 26, 18, 31, 18, 29, 19, 30, 19, 31, 19, 32, 23, 30, 22, 31, 22, 32, 22, 34
OFFSET
1,4
FORMULA
a(n) = Sum_{i=1..n-1} mu(i)^2 * mu(2n-i)^2, where mu is the Möbius function (A008683).
MATHEMATICA
Table[Sum[MoebiusMu[i]^2*MoebiusMu[2 n - i]^2, {i, n - 1}], {n, 80}]
PROG
(PARI) A294248(n)=sum(i=1, n-1, moebius(i)^2*moebius(2*n-i)^2); \\ R. J. Cano, Oct 25 2017
CROSSREFS
Sequence in context: A287863 A126088 A363833 * A085671 A126324 A035557
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Oct 25 2017
STATUS
approved