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 A088011 #15 Sep 21 2019 08:25:51
%S A088011 4,6,8,10,16,20,28,32,64,70,88,104,110,128,136,152,256,464,496,512,
%T A088011 592,650,884,1024,1155,1888,1952,2048,2144,4030,4096,5830,8128,8192,
%U A088011 8384,8925,11096,16384,17816,18632,18904,32128,32445,32768,32896,33664,45356
%N A088011 Even and odd solutions to abs(sigma(x)-2x) <= log(x). Numbers n whose abundance-radius does not exceed log(n).
%C A088011 See A088012 for the subsequence of odd terms, only 7 being known up to 10^13. - _M. F. Hasler_, Feb 21 2017
%H A088011 Amiram Eldar, <a href="/A088011/b088011.txt">Table of n, a(n) for n = 1..10000</a>
%t A088011 abu[x_] := Abs[DivisorSigma[1, x]-2*x] Do[If[ !Greater[abu[n], Log[n]//N], Print[n]], {n, 1, 100000}]
%o A088011 (PARI) (is(n)=abs(sigma(n)-2*n)<log(n)); select(is,[1..5000]) \\ _M. F. Hasler_, Feb 21 2017
%Y A088011 Cf. A088007-A088012, A077374, A005100, A005101, A000079, A000396.
%K A088011 nonn
%O A088011 1,1
%A A088011 _Labos Elemer_, Oct 20 2003