Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Jul 09 2015 21:50:45
%S 2,3,1,3,2,2,2,2,4,1,4,2,1,3,5,2,1,5,3,1,2,2,1,5,1,3,3,2,2,2,1,3,5,1,
%T 5,1,2,2,3,3,1,1,6,2,3,2,2,1,6,1,2,6,4,2,1,2,3,4,6,2,1,3,2,2,2,2,1,6,
%U 1,2,4,1,2,2,3,2,6,2,1,6,4,3,1,4,2,1,2,7,1,2,2,1,4,7,2,1,3,7,2,3,1,2,2,1,3
%N Minimum m where (c_n)^m is mutinous (i.e., part of sequence A027854), where c_n is the n-th positive integer not a prime power.
%C Prime powers (p^k, k = nonnegative integer) raised to a power are never mutinous.
%F m = ceiling[log(p)/(log(c_n) - k log(p))], where p is the largest prime to divide c_n and p^k is the highest power of p to divide c_n.
%e a(1) = 2 because the first non-prime-power is 6; and 6^2 = 36, but not 6^1, is mutinous.
%Y Cf. A027854, A024619.
%K nonn
%O 1,1
%A _Leroy Quet_, Aug 03 2001
%E Definition clarified by _Jonathan Sondow_, May 18 2014