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

A294210
Sum of the larger parts in the partitions of n into two squarefree parts or two nonsquarefree parts.
2
0, 1, 2, 5, 3, 8, 11, 22, 13, 12, 16, 42, 37, 31, 37, 83, 59, 65, 44, 116, 71, 101, 73, 177, 109, 109, 118, 198, 150, 121, 150, 283, 200, 216, 196, 452, 254, 219, 246, 485, 312, 280, 350, 602, 429, 302, 316, 686, 490, 351, 282, 780, 567, 568, 298, 819, 596
OFFSET
1,3
FORMULA
a(n) = Sum_{i=1..floor(n/2)} (n-i) * [A008966(i) = A008966(n-i)], where [] is the Iverson bracket.
MATHEMATICA
Table[Sum[(n - k)*KroneckerDelta[MoebiusMu[k]^2, MoebiusMu[n - k]^2], {k, Floor[n/2]}], {n, 80}]
CROSSREFS
Sequence in context: A081146 A261927 A262870 * A244418 A082652 A194007
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Oct 24 2017
STATUS
approved