This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A341620 #13 Feb 22 2021 14:25:30
%S A341620 0,0,0,0,0,1,0,0,0,0,0,2,0,0,0,0,0,2,0,1,0,0,0,3,0,0,0,1,0,2,0,0,0,0,
%T A341620 0,4,0,0,0,2,0,2,0,0,0,0,0,4,0,0,0,0,0,3,0,2,0,0,0,5,0,0,0,0,0,2,0,0,
%U A341620 0,1,0,6,0,0,0,0,0,2,0,3,0,0,0,5,0,0,0,1,0,4,0,0,0,0,0,5,0,0,0,2,0,2,0,1,0,0,0,6,0,0,0,3,0,2,0,0,0,0,0,8
%N A341620 Number of nondeficient divisors of n.
%C A341620 Number of nondeficient numbers (A023196) dividing n.
%H A341620 Antti Karttunen, <a href="/A341620/b341620.txt">Table of n, a(n) for n = 1..65537</a>
%H A341620 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A341620 a(n) = Sum_{d|n} A294936(d).
%F A341620 a(n) = A294927(n) + A294936(n).
%F A341620 a(n) = A080224(n) + A080225(n) = A000005(n) - A080226(n).
%F A341620 a(n) >= A337690(n) for all n.
%F A341620 a(n) = 1 iff A341619(n) = 1.
%t A341620 a[n_] := DivisorSum[n, 1 &, DivisorSigma[1, #] >= 2*# &]; Array[a, 120] (* _Amiram Eldar_, Feb 22 2021 *)
%o A341620 (PARI)
%o A341620 A294936(n) = (sigma(n, -1)>=2); \\ From A294936.
%o A341620 A341620(n) = sumdiv(n,d,A294936(d));
%o A341620 (PARI) A341620(n) = sumdiv(n,d,(sigma(d)>=(2*d)));
%Y A341620 Cf. A000005, A006039 (positions of ones), A023196, A080224, A080225, A080226, A294927, A294936, A337690, A341619.
%Y A341620 Differs from a derived sequence A341624 for the first time at n=120, where a(120)=8, while A341624(120)=1.
%K A341620 nonn
%O A341620 1,12
%A A341620 _Antti Karttunen_, Feb 21 2021