The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A353329 Number of divisors d of n for which A332823(d) is negative (-1). 9
 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 0, 2, 1, 2, 2, 1, 0, 3, 1, 1, 1, 2, 1, 2, 0, 2, 1, 1, 1, 3, 1, 1, 2, 2, 0, 3, 1, 2, 2, 1, 0, 3, 1, 2, 1, 2, 1, 2, 1, 3, 2, 1, 0, 4, 1, 1, 2, 2, 1, 2, 0, 2, 1, 2, 1, 4, 0, 1, 2, 2, 1, 3, 1, 3, 2, 1, 0, 4, 1, 1, 2, 2, 1, 4, 2, 2, 1, 1, 1, 4, 0, 2, 2, 3, 1, 2, 0, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,12 COMMENTS Number of divisors of n such that A048673(d) == -1 (mod 3). LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 Index entries for sequences computed from indices in prime factorization FORMULA a(n) = Sum_{d|n} [A332823(d) < 0], where [ ] is the Iverson bracket, giving 1 only if A332823 computed for the divisor d is strictly negative, and 0 otherwise. a(n) = A353328(n) - A353354(n). a(n) = A353351(n) - A353328(n). a(n) = A353328(A003961(n)). PROG (PARI) A332823(n) = { my(f = factor(n), u=(sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2)%3); if(2==u, -1, u); }; A353329(n) = sumdiv(n, d, (A332823(d)<0)); CROSSREFS Cf. A003961, A048675, A332823, A353328, A353351, A353352, A353354. Cf. A353355 [a(n) == A353328(n)], A353356 [a(n) < A353328(n)], A353357 [a(n) > A353328(n)]. Sequence in context: A025924 A025904 A137993 * A282778 A342788 A059883 Adjacent sequences: A353326 A353327 A353328 * A353330 A353331 A353332 KEYWORD nonn AUTHOR Antti Karttunen and Peter Munn, Apr 16 2022 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.

Last modified April 20 17:12 EDT 2024. Contains 371845 sequences. (Running on oeis4.)