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.
%I A185617 #7 Jul 22 2025 09:57:38
%S A185617 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 A185617 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 A185617 4,7,4,11,5,2,6,11,8,5,4,4,3,8,11
%N A185617 Least m for which A185615(n) divides A000201(A185615(n))^m.
%C A185617 Is m always <= n?
%C A185617 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 A185617 Cf. A000201, A185615, A185616
%K A185617 nonn
%O A185617 1,2
%A A185617 Paul D. Hanna and _Sean A. Irvine_, Jan 31 2011