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 A348714 #5 Oct 31 2021 09:35:36
%S A348714 1,6,24,30,60,120,168,180,240,360,420,720,840,1260
%N A348714 Numbers whose divisors can be partitioned into two disjoint sets with equal arithmetic mean in a record number of ways.
%C A348714 The corresponding record values are 0, 1, 2, 3, 19, 72, 99, 136, 248, 3094, 10452, 78057, 1323260, 4686578, ...
%e A348714 6 is the smallest number whose set of divisors can be partitioned into two disjoint sets with equal arithmetic mean: {3} and {1, 2, 6}.
%e A348714 24 is the smallest number whose set of divisors can be partitioned into two disjoint sets with equal arithmetic mean in two ways: ({3, 12}, {1, 2, 4, 6, 8, 24}) and ({1, 2, 3, 24}, {4, 6, 8, 12}).
%t A348714 c[n_] := Count[Subsets[(d = Divisors[n])], _?(Mean[#] == Mean[Complement[d, #]] &)]/2; cm = -1; s = {}; Do[If[(c1 = c[n]) > cm, cm = c1; AppendTo[s, n]], {n, 1, 250}]; s
%Y A348714 Cf. A027750, A083212, A348713.
%K A348714 nonn,more
%O A348714 1,2
%A A348714 _Amiram Eldar_, Oct 31 2021