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 A204695 #23 Jun 05 2016 02:02:27
%S A204695 1,1,4,0,4,2,0,7,1,0,1,5,0,4,7,0,7,8,0,1,4,0,4,2,0,7,1,0,1,5,0,4,7,0,
%T A204695 7,8,0,1,4,0,4,2,0,7,1,0,1,5,0,4,7,0,7,8,0,1,4,0,4,2,0,7,1,0,1,5,0,4,
%U A204695 7,0,7,8,0,1,4,0,4,2,0,7,1,0,1,5,0,4,7
%N A204695 a(n) = n^n (mod 9).
%C A204695 For n>0, periodic with period 18 = A174824(9): repeat [1, 4, 0, 4, 2, 0, 7, 1, 0, 1, 5, 0, 4, 7, 0, 7, 8, 0].
%H A204695 <a href="/index/Rec#order_18">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F A204695 G.f.: (x^18 - 8*x^17 - 7*x^16 - 7*x^14 - 4*x^13 - 5*x^11 - x^10 - x^8 - 7*x^7 - 2*x^5 - 4*x^4 - 4*x^2 - x - 1)/(x^18 - 1). - _Chai Wah Wu_, Jun 04 2016
%F A204695 a(n) = A000312(n) mod 9. - _Michel Marcus_, Jun 04 2016
%t A204695 Table[PowerMod[n,n,9], {n,0,100}]
%t A204695 Join[{1},LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},{1, 4, 0, 4, 2, 0, 7, 1, 0, 1, 5, 0, 4, 7, 0, 7, 8, 0},86]] (* _Ray Chandler_, Aug 27 2015 *)
%o A204695 (PARI) a(n)=lift(Mod(n,9)^n) \\ _Charles R Greathouse IV_, Jan 23 2012
%Y A204695 Cf. A000312, A174824.
%K A204695 nonn,easy
%O A204695 0,3
%A A204695 _José María Grau Ribas_, Jan 18 2012