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 A381549 #9 Mar 12 2025 13:21:14
%S A381549 96236031968,229687160624,274957745984,331240852304,363015363248,
%T A381549 386136575824,407374391150,623810538350,734609097584,745885389248,
%U A381549 1080953007848
%N A381549 Numbers k such that k, k+1 and k+2 all have an odd number of abundant divisors.
%C A381549 a(11) > 10^12, if it exists.
%e A381549 96236031968 is a term since it has 7 abundant divisors (992, 512368, 1024736, 46580848, 93161696, 48118015984, 96236031968), 96236031968 + 1 = 96236031969 has 9 abundant divisors (7857927, 10025631, 12641013, 290743299, 2600973837, 3318483861, 4184175303, 5660943057, 96236031969), and 96236031968 + 2 = 96236031970 has one abundant divisor (96236031970 itself).
%t A381549 q[n_] := q[n] = OddQ[DivisorSum[n, 1 &, DivisorSigma[-1, #] > 2 &]]; With[{v = Import["https://oeis.org/A096536/b096536.txt", "Table"][[;; , 2]]}, Select[v, q[#] && q[# + 1] && q[# + 2] &]]
%Y A381549 Subsequence of A096536, A381546 and A381548.
%K A381549 nonn,more
%O A381549 1,1
%A A381549 _Amiram Eldar_, Feb 26 2025
%E A381549 a(11) from _Jinyuan Wang_, Mar 12 2025