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.

A374127 a(n) = (sigma(n) - sopfr(n)) - n, where sigma is the sum of divisors, and sopfr is the sum of prime factors (with repetition).

Original entry on oeis.org

0, -1, -2, -1, -4, 1, -6, 1, -2, 1, -10, 9, -12, 1, 1, 7, -16, 13, -18, 13, 1, 1, -22, 27, -4, 1, 4, 17, -28, 32, -30, 21, 1, 1, 1, 45, -36, 1, 1, 39, -40, 42, -42, 25, 22, 1, -46, 65, -6, 31, 1, 29, -52, 55, 1, 51, 1, 1, -58, 96, -60, 1, 28, 51, 1, 62, -66, 37, 1, 60, -70, 111, -72, 1, 36, 41, 1, 72, -78, 93, 28
Offset: 1

Views

Author

Antti Karttunen, Jul 06 2024

Keywords

Crossrefs

Programs

Formula

a(n) = A086665(n) - n.
a(n) = A000203(n) - A075254(n);