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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A353372 Inverse Möbius transform of A353370. 3
 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 2, 3, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 1, 1, 2, 3, 1, 1, 2, 3, 1, 3, 1, 2, 2, 2, 2, 3, 1, 1, 1, 1, 1, 4, 1, 2, 1, 1, 1, 4, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 3, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS Number of terms of A325698 that divide n. 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} A353370(d). a(n) = A000005(n) - A353371(n). a(p) = 1 for all primes p. a(n) = a(A003961(n)) = a(A348717(n)), for all n >= 1. PROG (PARI) A353370(n) = { my(f = factor(n)); (0==sum(i=1, #f~, f[i, 2]*((-1)^(primepi(f[i, 1])%2)))); }; A353372(n) = sumdiv(n, d, A353370(d)); CROSSREFS Cf. A000005, A003961, A325698, A353370, A353371. Sequence in context: A317240 A348444 A326620 * A305501 A184170 A025919 Adjacent sequences: A353369 A353370 A353371 * A353373 A353374 A353375 KEYWORD nonn AUTHOR Antti Karttunen, 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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)