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.

A185617 Least m for which A185615(n) divides A000201(A185615(n))^m.

Original entry on oeis.org

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

Views

Author

Paul D. Hanna and Sean A. Irvine, Jan 31 2011

Keywords

Comments

Is m always <= n?
If A185615(n) = p_1^{e_1} * p_2^{e_2} * ... * p_r^{e_r}, then m <= max{e_1,e_2,...,e_r}.

Crossrefs