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.

A373976 a(n) = A001222(n) - A001222(A001414(n)), where A001222 is bigomega, the number of prime factors with multiplicity, and A001414 is sopfr, sum of prime factors with multiplicity. a(1) = 0 by convention.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 24 2024

Keywords

Crossrefs

Cf. also A045835.

Programs

Formula

a(n) = A001222(n) - A342956(n).