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 A340111 #10 Dec 29 2020 02:53:52
%S A340111 1,2,3,4,7,8,12,16,24,32,36,48,56,64,72,96,108,128,144,192,200,216,
%T A340111 288,360,400,432,504,576,648,720,792,800,864,1008,1080,1152,1296,1440,
%U A340111 1512,1584,1728,1800,1944,2016,2160,2304,2592,2880,3024,3240,3456,3600
%N A340111 Coreful highly abundant numbers: numbers m such that csigma(m) > csigma(k) for all k < m, where csigma is the sum of the coreful divisors function (A057723).
%C A340111 A coreful divisor d of a number k is a divisor with the same set of distinct prime factors as k, or rad(d) = rad(k), where rad(k) is the largest squarefree divisor of k (A007947).
%C A340111 Analogous to highly abundant numbers (A002093) with the sum of the coreful divisors function (A057723) instead of the sum of divisors function (A000203).
%H A340111 Amiram Eldar, <a href="/A340111/b340111.txt">Table of n, a(n) for n = 1..533</a> (terms below 10^10)
%e A340111 The first 10 values of A057723(n) for n=1..10 are: 1, 2, 3, 6, 5, 6, 7, 14, 12, 10. The record values, 1, 2, 3, 6, 7 and 14 occur at 1, 2, 3, 4, 7 and 8, the first 6 terms of this sequence.
%t A340111 f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 1; s[n_] := Times @@ (f @@@ FactorInteger[n]); seq = {}; sm = 0; Do[s1 = s[n]; If[s1 > sm, sm = s1; AppendTo[seq, n]], {n, 1, 3600}]; seq
%Y A340111 Cf. A007947, A057723, A283052, A308053.
%Y A340111 Similar sequences: A002093, A285614, A292983, A327634, A328134, A329883.
%K A340111 nonn
%O A340111 1,2
%A A340111 _Amiram Eldar_, Dec 28 2020