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 A334419 #10 Apr 30 2020 03:25:41
%S A334419 20,104,945,2210,2584,8415,10184,12104,15368,86272,133484,135470,
%T A334419 140668,643336,700256,1149952,2410816,2434888,5924032,6100605,7623872,
%U A334419 8531144,8760424,9405045,10471755,14803216,16283085,21506432,26919250,34441946,35622016,36064964
%N A334419 Primitive abundant numbers (A071395) with a record gap to the next primitive abundant number.
%C A334419 The record gap values are 50, 168, 239, 260, 406, 510, ... (see the link for more values).
%H A334419 Amiram Eldar, <a href="/A334419/b334419.txt">Table of n, a(n) for n = 1..59</a>
%H A334419 Amiram Eldar, <a href="/A334419/a334419.txt">Table of n, a(n), gap(n) for n = 1..59</a>
%e A334419 The first 5 terms of A071395 are 20, 70, 88, 104 and 272. The differences between these terms are 50, 18, 16, and 168. The record gaps are 50 and 168, which occur after the terms 20 and 104.
%t A334419 primAbQ[n_] := DivisorSigma[1, n] > 2 n && AllTrue[Most @ Rest @ Divisors[n], DivisorSigma[1, #] < 2*# &]; seq = {}; m = 20; dm = 0; Do[If[primAbQ[n], d = n - m; If[d > dm, dm = d; AppendTo[seq, m]]; m = n], {n, 21, 10^6}]; seq
%Y A334419 Cf. A071395, A330872, A334418.
%Y A334419 Similar sequences: A306747, A306748, A306953.
%K A334419 nonn
%O A334419 1,1
%A A334419 _Amiram Eldar_, Apr 29 2020