cp's OEIS Frontend

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.

A385398 Numbers m >= 1 such that Sum_{k = 1..m} gcd(m, floor(m / k)) > Sum_{k = 1..m} gcd(m, ceiling(m / k)).

Original entry on oeis.org

407, 539, 559, 637, 671, 793, 803, 949, 1037, 1067, 1159, 1241, 1273, 1331, 1469, 1649, 1679, 1727, 1817, 1843, 1853, 1919, 2057, 2159, 2197, 2231, 2299, 2321, 2507, 2651, 2669, 2743, 2783, 2813, 2873, 2983, 2987, 3007, 3077, 3133, 3161, 3179, 3193, 3211, 3379
Offset: 1

Views

Author

Ctibor O. Zizka, Jun 27 2025

Keywords

Examples

			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.
		

Crossrefs

Programs

  • 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