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.

Previous Showing 11-11 of 11 results.

A373923 a(n) = Sum_{d|n} (-1)^pi(d).

Original entry on oeis.org

1, 0, 2, 1, 0, 0, 2, 2, 3, 0, 0, 0, 2, 2, 2, 3, 0, 0, 2, 2, 4, 0, 0, 0, -1, 0, 2, 2, 2, 2, 0, 2, 0, -2, 0, -1, 2, 2, 4, 4, 0, 2, 2, 2, 4, 0, 0, 0, 1, -2, 0, 0, 2, 0, 0, 4, 4, 2, 0, 2, 2, 0, 6, 3, 2, 0, 0, -2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 6, 3, 0, 0, 0, -2, 0, 2, 2
Offset: 1

Views

Author

Wesley Ivan Hurt, Jun 22 2024

Keywords

Comments

Inverse Möbius transform of (-1)^pi(n) (A065357).

Crossrefs

Cf. A000720 (pi), A065357, A065358 (Jacob's Ladder sequence).

Programs

  • Maple
    f:= proc(n) local d; add((-1)^numtheory:-pi(d),d=numtheory:-divisors(n)) end proc:
    map(f, [$1..100]); # Robert Israel, Sep 13 2024
  • Mathematica
    Table[DivisorSum[n, (-1)^PrimePi[#] &], {n, 100}]
Previous Showing 11-11 of 11 results.