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!)
A294263 Sum of the larger parts of the partitions of n into two parts with smaller part squarefree > 1. 0
0, 0, 0, 2, 3, 7, 9, 11, 13, 20, 23, 32, 36, 47, 52, 57, 62, 67, 72, 87, 93, 110, 117, 124, 131, 151, 159, 181, 190, 214, 224, 234, 244, 271, 282, 293, 304, 334, 346, 358, 370, 403, 416, 451, 465, 502, 517, 532, 547, 562, 577, 618, 634, 650, 666, 682, 698 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = Sum_{i=2..floor(n/2)} (n - i) * mu(i)^2, where mu is the Möbius function (A008683).
MATHEMATICA
Table[Sum[(n - i) MoebiusMu[i]^2, {i, 2, Floor[n/2]}], {n, 80}]
CROSSREFS
Sequence in context: A278485 A279064 A294109 * A345745 A280110 A203234
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Oct 26 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 April 24 19:59 EDT 2024. Contains 371963 sequences. (Running on oeis4.)