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.

A134665 Exponent of highest power of 2 dividing the n-th multiply perfect number A007691.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 5, 3, 9, 2, 9, 12, 7, 9, 8, 8, 13, 16, 7, 7, 10, 14, 13, 18, 14, 13, 11, 5, 10, 10, 8, 11, 11, 7, 7, 14, 15, 5, 9, 30, 11, 8, 17, 15, 11, 11, 14, 20, 20, 20, 15, 21, 19, 25, 19, 15, 17, 17, 17, 22, 25, 20, 25, 19, 19, 19, 27, 19, 19, 27, 17, 19, 27, 19, 21, 23, 20
Offset: 1

Views

Author

T. D. Noe, Nov 05 2007

Keywords

Comments

The large terms, for example at n=41, correspond to the perfect numbers A000396 in A007691. See A134666 for the number of multiply perfect numbers having a given highest exponent of 2.

Crossrefs

Formula

a(n) = A007814(A007691(n)). - Michel Marcus, Oct 10 2017