login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A294238 Sum of the parts in the partitions of n into two parts with smaller part nonsquarefree. 1
0, 0, 0, 0, 0, 0, 0, 8, 9, 10, 11, 12, 13, 14, 15, 32, 34, 54, 57, 60, 63, 66, 69, 96, 100, 104, 108, 112, 116, 120, 124, 160, 165, 170, 175, 216, 222, 228, 234, 280, 287, 294, 301, 308, 315, 322, 329, 384, 392, 450, 459, 468, 477, 540, 550, 616, 627, 638 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
FORMULA
a(n) = n * Sum_{i=1..n} (1 - mu(i)^2), where mu is the Möbius function (A008683).
MATHEMATICA
Table[n*Sum[(1 - MoebiusMu[k]^2), {k, Floor[n/2]}], {n, 80}]
CROSSREFS
Sequence in context: A182361 A023391 A115419 * A161639 A250044 A295291
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)