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 A385398 #9 Jul 02 2025 19:41:43
%S A385398 407,539,559,637,671,793,803,949,1037,1067,1159,1241,1273,1331,1469,
%T A385398 1649,1679,1727,1817,1843,1853,1919,2057,2159,2197,2231,2299,2321,
%U A385398 2507,2651,2669,2743,2783,2813,2873,2983,2987,3007,3077,3133,3161,3179,3193,3211,3379
%N A385398 Numbers m >= 1 such that Sum_{k = 1..m} gcd(m, floor(m / k)) > Sum_{k = 1..m} gcd(m, ceiling(m / k)).
%e A385398 m = 407: Sum_{k = 1..407} gcd(407, floor(407 / k)) = 909, Sum_{k = 1..407} gcd(407, ceiling(407 / k)) = 899, 909 > 899, thus m = 407 is a term.
%o A385398 (PARI) isok(m) = sum(k=1, m, gcd(m, floor(m/k))) > sum(k=1, m, gcd(m, ceil(m/k))); \\ _Michel Marcus_, Jun 28 2025
%Y A385398 Cf. A018804, A384628, A385402.
%K A385398 nonn
%O A385398 1,1
%A A385398 _Ctibor O. Zizka_, Jun 27 2025