login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A343220
Number of unitary divisors d of n for which A003415(sigma(d)) > d.
4
0, 0, 1, 0, 0, 2, 1, 0, 0, 1, 1, 2, 0, 2, 2, 0, 1, 0, 1, 1, 3, 2, 1, 2, 0, 1, 1, 2, 1, 5, 1, 1, 3, 2, 2, 0, 0, 2, 2, 1, 0, 6, 1, 2, 1, 2, 1, 2, 0, 0, 3, 1, 1, 2, 2, 2, 3, 2, 1, 5, 0, 2, 2, 0, 1, 6, 1, 2, 3, 5, 1, 1, 0, 1, 2, 2, 3, 5, 1, 1, 0, 1, 1, 6, 2, 2, 3, 2, 1, 3, 2, 2, 3, 2, 2, 3, 0, 1, 2, 0, 0, 6, 1, 1, 6
OFFSET
1,6
COMMENTS
Number of divisors d of n such that gcd(d,n/d) = 1 and d is in A343218.
Number of terms k of A343218 that divide n, and k and n/k are relatively prime.
LINKS
FORMULA
a(n) = Sum_{d|n, gcd(d,n/d)=1} A343219(d).
PROG
(PARI)
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A343219(n) = (A003415(sigma(n))>n);
A343220(n) = sumdiv(n, d, if(1==gcd(d, n/d), A343219(d), 0));
CROSSREFS
Cf. A000203, A003415, A342925, A343218, A343219, A343225 (positions of 1's).
Sequence in context: A335664 A269518 A219840 * A264893 A340653 A334744
KEYWORD
nonn,look
AUTHOR
Antti Karttunen, Apr 09 2021
STATUS
approved