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!)
A364933 a(n) = Sum_{k=1..n} A191898(n,k)*[A191904(n,k) = A191898(n,k)]. 0
0, -1, -1, 0, -1, -2, -1, 2, 3, -2, -1, 0, -1, -2, 1, 6, -1, 2, -1, 2, 3, -2, -1, 4, 15, -2, 15, 4, -1, 0, -1, 14, 7, -2, 13, 8, -1, -2, 9, 10, -1, 2, -1, 8, 17, -2, -1, 12, 35, 14, 13, 10, -1, 14, 25, 16, 15, -2, -1, 8, -1, -2, 27, 30, 31, 6, -1, 14, 19, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(n) = Sum_{k=1..n} A191898(n,k)*[A191904(n,k) = A191898(n,k)].
Conjecture: a(n) = A057859(n) - A008472(n) - 1.
MATHEMATICA
f[n_] := DivisorSum[n, MoebiusMu[#] # &]; Table[Sum[If[If[Mod[n, k] == 0, 1 - k, 1] == f[GCD[n, k]], f[GCD[n, k]], 0], {k, 1, n}], {n, 1, 70}]
CROSSREFS
Sequence in context: A243919 A231775 A128065 * A361158 A329744 A277889
KEYWORD
sign
AUTHOR
Mats Granvik, Aug 13 2023
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 28 07:46 EDT 2024. Contains 372020 sequences. (Running on oeis4.)