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 A333503 #11 Apr 08 2020 16:32:52 %S A333503 630,630,630,630,630,630,630,420,210,450,180,210,420,180,450,210,330, %T A333503 90,420,210,420,210,630,630,630,630,420,210,630,630,630,210,420,630, %U A333503 630,630,630,630,630,90,330,210,630,630,630,210,330,90,630,210,420,630,630 %N A333503 Differences between consecutive odd abundant numbers. %C A333503 a(n) = A005231(n+1) - A005231(n). %C A333503 Since 945+1890*k is odd and abundant for all k, 1890 is the maximal term that occurs. The first time it occurs is for a(274)=1890, and the involved odd abundant numbers are 135135 and 137025. %C A333503 Clearly 2 is the minimal term that can occur. For an example, see comment to A294025. %H A333503 Jeppe Stig Nielsen, <a href="/A333503/b333503.txt">Table of n, a(n) for n = 1..1000</a> %t A333503 Differences@ Select[Range[947, 3*10^4 + 1, 2], DivisorSigma[1, #] > 2 # &] (* _Michael De Vlieger_, Mar 25 2020 *) %o A333503 (PARI) my(oldn=945); forstep(n=947, 5*10^4, 2, if(sigma(n)>2*n, print1(n-oldn, ", "); oldn=n)) %Y A333503 Cf. A005231, A294025. %K A333503 nonn %O A333503 1,1 %A A333503 _Jeppe Stig Nielsen_, Mar 24 2020