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!)
A369865 a(n) = n * Sum_{p|n, p prime} mu(n/p)^2 / p. 0
0, 1, 1, 2, 1, 5, 1, 0, 3, 7, 1, 6, 1, 9, 8, 0, 1, 6, 1, 10, 10, 13, 1, 0, 5, 15, 0, 14, 1, 31, 1, 0, 14, 19, 12, 0, 1, 21, 16, 0, 1, 41, 1, 22, 15, 25, 1, 0, 7, 10, 20, 26, 1, 0, 16, 0, 22, 31, 1, 30, 1, 33, 21, 0, 18, 61, 1, 34, 26, 59, 1, 0, 1, 39, 15, 38, 18, 71, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(p^k) = p^(k-1) for p prime and 1 <= k <= 2, else 0 if k >= 3. - Wesley Ivan Hurt, Jun 26 2024
MATHEMATICA
Table[n*DivisorSum[n, (MoebiusMu[n/#]^2)/# &, PrimeQ[#] &], {n, 100}]
CROSSREFS
Sequence in context: A317301 A131915 A078036 * A175178 A348494 A256541
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Feb 03 2024
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 September 11 13:39 EDT 2024. Contains 375836 sequences. (Running on oeis4.)