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!)
A294284 Sum of the smaller parts of the partitions of n into two distinct parts with larger part squarefree. 0
0, 0, 1, 1, 2, 1, 3, 6, 9, 7, 10, 8, 11, 8, 12, 17, 22, 28, 34, 31, 37, 33, 40, 48, 56, 51, 59, 53, 60, 53, 61, 70, 79, 72, 82, 93, 104, 97, 109, 122, 135, 128, 142, 135, 149, 140, 154, 169, 184, 199, 214, 204, 219, 235, 251, 268, 285, 274, 292, 281 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
Sum of the widths of the distinct rectangles with squarefree length and positive integer width such that L + W = n, W < L. For example, a(13) = 11; the rectangles are 2 X 11, 3 X 10, 6 X 7. The sum of the widths is then 2 + 3 + 6 = 11. - Wesley Ivan Hurt, Nov 12 2017
LINKS
FORMULA
a(n) = Sum_{i=1..floor((n-1)/2)} i * mu(n-i)^2, where mu is the Möbius function (A008683).
MATHEMATICA
Table[Sum[i*MoebiusMu[n - i]^2, {i, Floor[(n-1)/2]}], {n, 60}]
PROG
(PARI) a(n) = sum(i=1, (n-1)\2, i*moebius(n-i)^2); \\ Michel Marcus, Nov 05 2017
CROSSREFS
Sequence in context: A053225 A050043 A113396 * A295678 A057925 A086964
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 23 02:14 EDT 2024. Contains 371906 sequences. (Running on oeis4.)