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 A091195 #9 Feb 16 2025 08:32:52 %S A091195 0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,2,2,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4, %T A091195 4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,7,7,7, %U A091195 7,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10 %N A091195 Number of numbers <= n having only one abundant divisor (A091191). %H A091195 Amiram Eldar, <a href="/A091195/b091195.txt">Table of n, a(n) for n = 1..10000</a> %H A091195 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AbundantNumber.html">Abundant Number</a>. %t A091195 f[n_] := Boole[Count[Divisors[n], _?(DivisorSigma[1, #] > 2 # &)] == 1]; Accumulate @ Array[f, 100] (* _Amiram Eldar_, Mar 21 2021 *) %Y A091195 Partial sums of A294930. %Y A091195 Cf. A091191, A091194, A005101. %K A091195 nonn %O A091195 1,18 %A A091195 _Reinhard Zumkeller_, Dec 27 2003