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!)
A336279 a(n) = Sum_{k=1..n} mu(k)*k^5. 7
1, -31, -274, -274, -3399, 4377, -12430, -12430, -12430, 87570, -73481, -73481, -444774, 93050, 852425, 852425, -567432, -567432, -3043531, -3043531, 1040570, 6194202, -242141, -242141, -242141, 11639235, 11639235, 11639235, -8871914, -33171914, -61801065 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Conjecture: a(n) changes sign infinitely often.
LINKS
FORMULA
From Seiichi Manyama, Apr 03 2023: (Start)
G.f. A(x) satisfies x = Sum_{k>=1} k^5 * (1 - x^k) * A(x^k).
Sum_{k=1..n} k^5 * a(floor(n/k)) = 1. (End)
MATHEMATICA
Array[Sum[MoebiusMu[k]*k^5, {k, #}] &, 32] (* Michael De Vlieger, Jul 15 2020 *)
PROG
(PARI) a(n) = sum(k=1, n, moebius(k)*k^5); \\ Michel Marcus, Jul 15 2020
(Python)
from functools import lru_cache
@lru_cache(maxsize=None)
def A336279(n):
if n <= 1:
return 1
c, j = 1, 2
k1 = n//j
while k1 > 1:
j2 = n//k1 + 1
c -= (j2**2*(j2**2*(j2*(2*j2 - 6) + 5) - 1)-j**2*(j**2*(j*(2*j - 6) + 5) - 1))//12*A336279(k1)
j, k1 = j2, n//j2
return c-(n**2*(n**2*(n*(2*n + 6) + 5) - 1)-j**2*(j**2*(j*(2*j - 6) + 5) - 1))//12 # Chai Wah Wu, Apr 04 2023
CROSSREFS
Sequence in context: A126526 A008386 A161558 * A156094 A221430 A115151
KEYWORD
easy,sign
AUTHOR
Donald S. McDonald, Jul 15 2020
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 12:22 EDT 2024. Contains 371937 sequences. (Running on oeis4.)