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 A276040 #9 Aug 26 2016 23:12:57
%S A276040 1,4,6,8,10,12,14,12,18,20,22,24,26,28,30,24,34,36,38,40,42,44,46,36,
%T A276040 50,52,45,56,58,60,62,48,66,68,70,72,74,76,78,60,82,84,86,88,90,92,94,
%U A276040 72,98,100,102,104,106,90,110,84,114,116,118,120
%N A276040 Least k such that n^n divides phi(k^k) (k > 0).
%C A276040 Indices of odd terms in this sequence are 1, 27, 81, 135, 189, 297, 343, 351, 405, 459, 513, 621, 625, 675, 783, ...
%e A276040 a(3) = 6 because 3^3 divides phi(6^6) = 15552.
%t A276040 Table[k = 1; While[! Divisible[EulerPhi[k^k], n^n], k++]; k, {n, 60}] (* _Michael De Vlieger_, Aug 21 2016 *)
%o A276040 (PARI) a(n) = {my(k = 1); while(eulerphi(k^k) % n^n, k++); k; }
%Y A276040 Cf. A064447.
%K A276040 nonn
%O A276040 1,2
%A A276040 _Altug Alkan_, Aug 17 2016