login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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

Table of n, a(n) for n=1..79.

CROSSREFS

Cf. A000201, A185615, A185616

Sequence in context: A174931 A058744 A323246 * A250268 A292137 A292138

Adjacent sequences:  A185614 A185615 A185616 * A185618 A185619 A185620

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 27 21:52 EDT 2020. Contains 334671 sequences. (Running on oeis4.)