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!)
 A294239 Sum of the parts in the partitions of n into two parts with larger part nonsquarefree. 2
 0, 0, 0, 0, 5, 6, 7, 8, 9, 20, 22, 24, 39, 42, 45, 48, 51, 54, 57, 60, 84, 88, 92, 96, 100, 130, 135, 168, 203, 210, 217, 224, 231, 238, 245, 252, 259, 266, 273, 280, 287, 294, 301, 308, 360, 414, 423, 432, 441, 500, 510, 520, 583, 594, 605, 616, 627, 638 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..2000 FORMULA a(n) = n * Sum_{i=1..floor(n/2)} (1 - mu(n-i)^2), where mu is the Möbius function (A008683). MATHEMATICA Table[n*Sum[(1 - MoebiusMu[n - k]^2), {k, Floor[n/2]}], {n, 80}] PROG (PARI) a(n) = n*sum(i=1, n\2, 1-moebius(n-i)^2); \\ Michel Marcus, Feb 11 2018 CROSSREFS Cf. A008683, A008966, A294238. Sequence in context: A037362 A102717 A015977 * A250050 A051052 A119368 Adjacent sequences:  A294236 A294237 A294238 * A294240 A294241 A294242 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 August 3 02:48 EDT 2021. Contains 346435 sequences. (Running on oeis4.)