A294927 Number of proper divisors of n that are nondeficient (A023196).

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 4, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 4, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 4, 0, 0, 0, 1, 0, 1, 0, 0, 0

Offset: 1

Author

Antti Karttunen, Nov 14 2017

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..20000

Crossrefs

Cf. A023196, A032741, A071395, A294887, A294926, A294928, A294929, A294936.

Programs

Mathematica

a[n_] := DivisorSum[n, 1 &, # < n && DivisorSigma[1, #] >= 2*# &]; Array[a, 100] (* Amiram Eldar, Mar 14 2024 *)

PARI

A294927(n) = sumdiv(n, d, (d=(2*d)));

Formula

a(n) = Sum_{d|n, dA294936(d).

a(n) + A294926(n) = A032741(n).