login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185617 Least m for which A185615(n) divides A000201(A185615(n))^m 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
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}.
LINKS
CROSSREFS
Sequence in context: A366297 A323246 A364721 * A250268 A342881 A292137
KEYWORD
nonn
AUTHOR
Paul D. Hanna and Sean A. Irvine, Jan 31 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 09:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)