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 A327635 #14 Sep 21 2019 02:49:30
%S A327635 21735,21944,43064,58695,188055,262184,414855,520695,567944,611415,
%T A327635 687015,764504,792855,809864,812889,833624,874664,911624,945944,
%U A327635 976184,991304,1019655,1026375,1065015,1073709,1157624,1201095,1218944,1248344,1254015,1272375,1272704
%N A327635 Numbers k such that both k and k+1 are infinitary abundant numbers (A129656).
%C A327635 The least k such that k, k+1 and k+2 are all infinitary abundant numbers is a(75976) = 2666847104.
%H A327635 Amiram Eldar, <a href="/A327635/b327635.txt">Table of n, a(n) for n = 1..10000</a>
%e A327635 21735 is in the sequence since both 21735 and 21736 are infinitary abundant: isigma(21735) = 46080 > 2 * 21735, and isigma(21736) = 50400 > 2 * 21736 (isigma is the sum of infinitary divisors, A049417).
%t A327635 f[p_, e_] := p^(2^(-1 + Position[Reverse @ IntegerDigits[e, 2], _?(# == 1 &)])); isigma[1] = 1; isigma[n_] := Times @@ (Flatten @ (f @@@ FactorInteger[n]) + 1); abQ[n_] := isigma[n] > 2n; s={}; ab1 = 0; Do[ab2 = abQ[n]; If[ab1 && ab2, AppendTo[s, n-1]]; ab1 = ab2, {n, 2, 10^5}]; s
%Y A327635 Cf. A049417, A127666, A129656.
%Y A327635 Cf. A096399, A292704, A318167.
%K A327635 nonn
%O A327635 1,1
%A A327635 _Amiram Eldar_, Sep 20 2019