The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A294235 Number of partitions of n into two parts such that the larger part is nonsquarefree. 2
 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 9, 9, 9, 9, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 16 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,10 LINKS FORMULA a(n) = Sum_{i=1..floor(n/2)} (1 - mu(n-i)^2), where mu is the Möbius function (A008683). MATHEMATICA Table[Sum[(1 - MoebiusMu[n - k]^2), {k, Floor[n/2]}], {n, 80}] CROSSREFS Cf. A008683, A008966, A294234. Sequence in context: A244317 A130255 A082527 * A186188 A227177 A132944 Adjacent sequences:  A294232 A294233 A294234 * A294236 A294237 A294238 KEYWORD nonn,easy AUTHOR Wesley Ivan Hurt, Oct 25 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 29 06:29 EDT 2020. Contains 337425 sequences. (Running on oeis4.)