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 A330872 #11 Apr 30 2020 03:25:29
%S A330872 82004,158235,516704,2921535,5801984,10846016,12374144,12603824,
%T A330872 18738224,24252074,32409530,33696975,35356544,36149295,41078114,
%U A330872 42541190,43485584,65090864,88304475,90725775,181480695,183872535,213261795,233762528,242301344,254502495,254630144
%N A330872 Numbers k such that k and k+1 are both primitive abundant numbers (A071395).
%C A330872 Not to be confused with A283418 in which the primitive abundant numbers can have perfect numbers as divisors (as defined in A091191).
%H A330872 Amiram Eldar, <a href="/A330872/b330872.txt">Table of n, a(n) for n = 1..100</a>
%e A330872 82004 is a term since both 82004 and 82005 are abundant, and all of their proper divisors are deficient numbers.
%t A330872 primAbQ[n_] := DivisorSigma[1, n] > 2 n && AllTrue[Most @ Rest @ Divisors[n], DivisorSigma[1, #] < 2*# &]; q1 = False; seq = {}; Do[q2 = primAbQ[n]; If[q1 && q2, AppendTo[seq, n - 1]]; q1 = q2, {n, 2, 6*10^6}]; seq
%Y A330872 Subsequence of A005101, A071395, A096399 and A283418.
%K A330872 nonn
%O A330872 1,1
%A A330872 _Amiram Eldar_, Apr 29 2020