A337345 Number of divisors d of n for which A003961(d) > 2*d.

0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 3, 0, 1, 1, 3, 0, 3, 0, 3, 1, 0, 0, 5, 0, 0, 2, 3, 0, 4, 0, 4, 0, 0, 1, 6, 0, 0, 1, 5, 0, 4, 0, 2, 3, 0, 0, 7, 1, 2, 0, 2, 0, 5, 0, 5, 1, 0, 0, 8, 0, 0, 3, 5, 0, 2, 0, 2, 1, 4, 0, 9, 0, 0, 2, 2, 0, 3, 0, 7, 3, 0, 0, 8, 0, 0, 0, 4, 0, 8, 1, 2, 0, 0, 0, 9, 0, 3, 2, 5, 0, 2, 0, 4, 4

Offset

1,8

Comments

Number of terms of A246282 that divide n.

Number of divisors d of n for which A048673(d) > d.

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} A252742(d).

a(n) = A337346(n) + A252742(n).

Prog

(PARI)
A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A337345(n) = sumdiv(n, d, A003961(d)>(d+d));

Crossrefs

Inverse Möbius transform of A252742.

Cf. A003961, A048673, A246282, A337346, A337372 (positions of ones).

Cf. also A080224.

Sequence in context: A147602 A114206 A073202 * A294904 A055212 A360661

Adjacent sequences: A337342 A337343 A337344 * A337346 A337347 A337348

Keyword

nonn

Author

Antti Karttunen, Aug 27 2020

Status

approved