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 A143837 #16 Aug 31 2019 04:34:54
%S A143837 1,3,4,6,7,10,11,16,21,24,26,39,45,52,66,73,93,99,102,105,110,111,118,
%T A143837 153,180,194,240,251,301,331,435,479,487,504,513,518,525,546,748,753,
%U A143837 921,993,1202,1285,1352,1600,1716,1869,1902,2221,2477,2601,2640,2807
%N A143837 a(n) = A066839(A141037(n)).
%H A143837 Amiram Eldar, <a href="/A143837/b143837.txt">Table of n, a(n) for n = 1..250</a>
%F A143837 a(n) = A066839(A141037(n)).
%e A143837 The value of 16 in this sequence corresponds to 1+2+3+4+6 = 16 with 1, 2, 3, 4 and 6 being the divisors of 36 <= sqrt(36).
%p A143837 A066839 := proc(n) a := 0 ; for k in numtheory[divisors](n) do if k^2 <= n then a := a+k ; fi; od: a ; end: A143837 := proc() rec := -1; for n from 1 do r := A066839(n) ; if r > rec then printf("%d, ",r) ; rec := r; fi; od: end: A143837() ; # _R. J. Mathar_, Nov 03 2008
%o A143837 (PARI) lista(nn) = {my(ms = 0); for (n=1, nn, sqn = sqrt(n); s = sumdiv(n, d, d*(d<=sqn)); if (s > ms, print1(s, ", "); ms = s););} \\ _Michel Marcus_, Oct 05 2015
%Y A143837 Cf. A066839, A141037.
%K A143837 nonn
%O A143837 1,2
%A A143837 _J. Lowell_, Sep 02 2008
%E A143837 More terms from _R. J. Mathar_, Nov 03 2008
%E A143837 Name edited by _Jon E. Schoenfield_ at the suggestion of _Joerg Arndt_, Oct 12 2015