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

%I #5 Mar 30 2012 18:39:41

%S 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,

%T 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,

%U 4,7,4,11,5,2,6,11,8,5,4,4,3,8,11

%N Least m for which A185615(n) divides A000201(A185615(n))^m

%C Is m always <= n?

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

%Y Cf. A000201, A185615, A185616

%K nonn

%O 1,2

%A Paul D. Hanna and _Sean A. Irvine_, Jan 31 2011

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 April 25 09:49 EDT 2024. Contains 371967 sequences. (Running on oeis4.)