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 A339940 #11 Dec 24 2020 04:47:40 %S A339940 72,108,200,784,900,1764,1936,2704,2744,4356,4900,6084,9248,10404, %T A339940 11552,12996,16928,19044,26912,30276,34596,47432,49284,60500,60516, %U A339940 61504,66248,66564,79524,84500,87616,99225,101124,107584,113288,118336,125316,133956,141376 %N A339940 Primitive coreful abundant numbers: coreful abundant numbers having no coreful abundant aliquot divisor. %C A339940 Analogous to A091191 as A057723 is analogous to A000203. %C A339940 All the coreful abundant numbers (A308053) are multiples of terms of this sequence. %H A339940 Amiram Eldar, <a href="/A339940/b339940.txt">Table of n, a(n) for n = 1..1000</a> %t A339940 f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 1; s[n_] := Times @@ (f @@@ FactorInteger[n]); cabQ[n_] := s[n] > 2*n; pricabQ[n_] := cabQ[n] && AllTrue[Most @ Divisors[n], !cabQ[#] &]; Select[Range[10^5], pricabQ] %Y A339940 Cf. A057723, A091191, A302574, A307959, A308053. %K A339940 nonn %O A339940 1,1 %A A339940 _Amiram Eldar_, Dec 23 2020