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 A276035 #10 Aug 18 2016 11:19:57 %S A276035 1,2,3,4,5,3,7,4,3,5,11,6,13,7,15,4,17,3,19,5,7,11,23,6,5,13,6,14,29, %T A276035 15,31,4,33,17,35,6,37,19,13,10,41,7,43,22,15,23,47,6,7,5,51,13,53,6, %U A276035 11,14,19,29,59,15,61,31,21,4,65,33,67,17,69,35 %N A276035 Least k such that n divides phi(k^k) (k > 0). %C A276035 The first term that has 3 prime divisors is a(240) = 2*3*5. %H A276035 Charles R Greathouse IV, <a href="/A276035/b276035.txt">Table of n, a(n) for n = 1..10000</a> %F A276035 (log n)/W(log n) < a(n) <= n for n > 1. - _Charles R Greathouse IV_, Aug 16 2016 %e A276035 a(9) = 3 because 9 divides phi(3^3) = 18. %o A276035 (PARI) a(n)=my(k = 1); while(eulerphi(k^k) % n, k++); k; %o A276035 (PARI) a(n)=my(k=1); while(eulerphi(k)*Mod(k,n)^(k-1), k++); k \\ _Charles R Greathouse IV_, Aug 16 2016 %Y A276035 Cf. A064447. %K A276035 nonn %O A276035 1,2 %A A276035 _Altug Alkan_, Aug 16 2016