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”).

A294926
Number of proper divisors of n that are deficient (A005100).
6
0, 1, 1, 2, 1, 3, 1, 3, 2, 3, 1, 4, 1, 3, 3, 4, 1, 4, 1, 5, 3, 3, 1, 5, 2, 3, 3, 5, 1, 6, 1, 5, 3, 3, 3, 5, 1, 3, 3, 6, 1, 6, 1, 5, 5, 3, 1, 6, 2, 5, 3, 5, 1, 5, 3, 6, 3, 3, 1, 7, 1, 3, 5, 6, 3, 6, 1, 5, 3, 7, 1, 6, 1, 3, 5, 5, 3, 6, 1, 7, 4, 3, 1, 7, 3, 3, 3, 7, 1, 8, 3, 5, 3, 3, 3, 7, 1, 5, 5, 7, 1, 6, 1, 7, 7
OFFSET
1,4
LINKS
FORMULA
a(n) = Sum_{d|n, d<n} A294934(d).
a(n) = A080226(n) - A294934(n).
a(n) + A294927(n) = A032741(n).
MATHEMATICA
a[n_] := DivisorSum[n, 1 &, # < n && DivisorSigma[1, #] < 2*# &]; Array[a, 100] (* Amiram Eldar, Mar 14 2024 *)
PROG
(PARI) A294926(n) = sumdiv(n, d, (d<n)*(sigma(d)<(2*d))); \\ Antti Karttunen, Nov 14 2017
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 14 2017
STATUS
approved