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.

A072869 a(n) = sigma(sigma(n)-n), where sigma = A000203, sum of the divisors of n.

Original entry on oeis.org

1, 1, 4, 1, 12, 1, 8, 7, 15, 1, 31, 1, 18, 13, 24, 1, 32, 1, 36, 12, 24, 1, 91, 12, 31, 14, 56, 1, 96, 1, 32, 24, 42, 14, 72, 1, 36, 18, 93, 1, 120, 1, 90, 48, 42, 1, 140, 15, 44, 32, 72, 1, 144, 18, 127, 24, 63, 1, 280, 1, 54, 42, 104, 20, 168, 1, 90, 40, 114, 1, 168, 1, 90, 57
Offset: 2

Views

Author

Benoit Cloitre, Jul 27 2002

Keywords

Crossrefs

Cf. A000203 (sigma(n)), A001065 (sigma(n) - n), A051027.
Cf. A072868 (fixed points).

Programs

Formula

a(n) = A000203(A001065(n)). - Michel Marcus, Nov 26 2013
For p prime, a(p) = 1. - Michel Marcus, Nov 19 2014
a(k) = k if k is one greater than a Mersenne prime. - Jarrod G. Sage, Dec 07 2024