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 A316886 #40 Jan 21 2022 03:46:48 %S A316886 1,2,3,4,6,8,10,12,16,18,20,24,30,36,42,48,60,72,84,90,96,108,120,144, %T A316886 168,180,210,216,240,288,300,336,360,420,480,504,540,600,630,660,672, %U A316886 720,840,960,1008,1080,1200,1260,1440,1560,1620,1680,1800,1920,1980 %N A316886 Where records occur in A299773. %C A316886 First differs from the highly abundant numbers (A002093) at a(41) = 672, while A002093(41) = 720. %H A316886 Amiram Eldar, <a href="/A316886/b316886.txt">Table of n, a(n) for n = 1..64</a> %e A316886 After a(40) = 660 we have that in the sequence A299773 the terms A299773(661)..A299773(671) are less than A299773(660) = 7187172406818511650939943511021032181119077585. The next term greater than A299773(660) is A299773(672) = 7187180892191062904110726467218877665371246875, so a(41) = 672. Note that both 660 and 672 have the same number of divisors (tau(660) = tau(672) = 24) and the same sum of divisors (sigma(660) = sigma(672) = 2016). %Y A316886 Cf. A000005, A000041, A000203, A002093, A299773, A316916. %K A316886 nonn %O A316886 1,2 %A A316886 _Omar E. Pol_, Jul 15 2018 %E A316886 More terms from _Amiram Eldar_, Aug 22 2019