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.

A134740 Number of distinct prime factors in the n-th multiply perfect number A007691(n).

Original entry on oeis.org

0, 2, 2, 3, 2, 3, 2, 4, 5, 4, 6, 5, 2, 5, 6, 6, 7, 5, 2, 7, 7, 6, 6, 6, 2, 7, 7, 7, 6, 8, 8, 8, 8, 6, 7, 8, 8, 9, 7, 8, 2, 9, 9, 9, 11, 10, 9, 10, 10, 8, 9, 11, 10, 10, 8, 11, 11, 10, 10, 11, 11, 9, 11, 9, 12, 11, 13, 13, 12, 11, 12, 12, 11, 13, 12, 12, 12, 11, 12, 13, 12, 11, 10, 13, 12, 11, 10
Offset: 1

Views

Author

T. D. Noe, Nov 07 2007

Keywords

Comments

If a multiply perfect number k has abundancy m = sigma(k)/k, then k must have at least A005579(m) distinct prime factors.

Crossrefs

Cf. A007691.