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.

A326146 a(n) = sigma(n) - A020639(n) - n, where A020639 gives the smallest prime factor of n, and sigma is the sum of divisors of n.

Original entry on oeis.org

-1, -1, -2, 1, -4, 4, -6, 5, 1, 6, -10, 14, -12, 8, 6, 13, -16, 19, -18, 20, 8, 12, -22, 34, 1, 14, 10, 26, -28, 40, -30, 29, 12, 18, 8, 53, -36, 20, 14, 48, -40, 52, -42, 38, 30, 24, -46, 74, 1, 41, 18, 44, -52, 64, 12, 62, 20, 30, -58, 106, -60, 32, 38, 61, 14, 76, -66, 56, 24, 72, -70, 121, -72, 38, 46, 62, 12, 88
Offset: 1

Views

Author

Antti Karttunen, Jun 10 2019

Keywords

Crossrefs

Programs

Formula

a(n) = A000203(n) - A020639(n) - n = A000203(n) - A061228(n).
a(n) = A001065(n) - A020639(n).
For n > 1, a(n) = A105086(n) - n.