A294242 Number of partitions of 2n into two parts with the larger part nonsquarefree.

0, 0, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 9, 9, 10, 10, 11, 11, 11, 11, 12, 13, 13, 13, 14, 14, 14, 15, 16, 16, 17, 17, 18, 18, 18, 18, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 22, 22, 23, 23, 25, 25, 25, 25, 26, 27, 27, 27, 28

Offset

1,5

Links

Table of n, a(n) for n=1..71.

Index entries for sequences related to partitions

Formula

a(n) = Sum_{i=1..n} (1 - mu(2*n-i)^2), where mu is the Möbius function (A008683).

Mathematica

Table[Sum[(1 - MoebiusMu[2 n - k]^2), {k, n}], {n, 80}]

Prog

(PARI) a(n) = sum(i=1, n, 1 - moebius(2*n-i)^2); \\ Michel Marcus, Feb 11 2018

Crossrefs

Cf. A008683, A008966, A057627.

Sequence in context: A108356 A239499 A241139 * A241092 A055656 A078571

Adjacent sequences: A294239 A294240 A294241 * A294243 A294244 A294245

Keyword

nonn,easy

Author

Wesley Ivan Hurt, Oct 25 2017

Status

approved