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.

A019286 Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,9)-perfect numbers.

Original entry on oeis.org

168, 10752, 331520, 691200, 1556480, 1612800, 106151936, 5099962368, 4010593484800
Offset: 1

Views

Author

Keywords

Comments

See also the Cohen-te Riele links under A019276.
No other terms < 5*10^11. - Jud McCranie, Feb 08 2012
4010593484800 is also a term. See comment in A019278. - Michel Marcus, May 15 2016

Crossrefs

Programs

  • PARI
    isok(n) = sigma(sigma(n))/n  == 9; \\ Michel Marcus, May 12 2016

Extensions

a(8) by Jud McCranie, Jan 28 2012
a(9) from Giovanni Resta, Feb 26 2020