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 A063047 #16 Jul 09 2015 21:50:45 %S A063047 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 A063047 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 A063047 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 A063047 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 A063047 Prime powers (p^k, k = nonnegative integer) raised to a power are never mutinous. %F A063047 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 A063047 a(1) = 2 because the first non-prime-power is 6; and 6^2 = 36, but not 6^1, is mutinous. %Y A063047 Cf. A027854, A024619. %K A063047 nonn %O A063047 1,1 %A A063047 _Leroy Quet_, Aug 03 2001 %E A063047 Definition clarified by _Jonathan Sondow_, May 18 2014