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.

A379924 Numbers m that divide the alternating sum Sum_{k=1..m} (-1)^(k+1) * usigma(k).

Original entry on oeis.org

1, 2, 9, 54, 101, 178, 189, 2071, 3070, 9171, 11450, 12794, 21405, 27553, 35285, 251974, 2069863, 2395894, 155931488, 387586437, 758519827, 1202435693, 9859113494, 42703260442
Offset: 1

Views

Author

Amiram Eldar, Jan 06 2025

Keywords

Comments

Numbers m such that m | A370898(m).
The corresponding quotients, A370898(m)/m, are -1, 1, 0, 6, 9, ... (see the link for more values).
a(25) > 5*10^10, if it exists.

Crossrefs

Cf. A034448 (usigma), A370898.

Programs

  • Mathematica
    usigma[n_] := Times @@ (1 + Power @@@ FactorInteger[n]); usigma[1] = 1; With[{m = 260000}, Position[Accumulate[Table[(-1)^n * usigma[n], {n, 1, m}]]/Range[m], _?IntegerQ] // Flatten]
  • PARI
    usigma(n) = {my(f = factor(n)); prod(i = 1, #f~, 1 + f[i, 1]^f[i, 2]); }
    list(lim) = my(s = 0); for(k = 1, lim, s += (-1)^k * usigma(k); if(!(s % k), print1(k, ", ")));