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 A233519 #6 Feb 19 2014 17:51:17
%S A233519 1,1,1,2,1,2,3,2,2,2,3,2,5,3,2,1,1,4,3,2,5,4,1,4,5,3,4,1,2,5,5,3,5,4,
%T A233519 2,5,7,3,2,2,1,5,3,9,3,7,6,2,1,2,6,3,8,5,5,2,1,8,3,10,2,1,8,6,9,1,9,
%U A233519 12,1,5,5,2,4,6,6,2,1,4,5,9,4,4,3,6,4,5,6
%N A233519 The number of times x^x == x (mod prime(n)) for x in 0 < x < prime(n).
%C A233519 This is A065295 restricted to the primes. The plot is significantly different.
%H A233519 T. D. Noe, <a href="/A233519/b233519.txt">Table of n, a(n) for n = 1..10000</a>
%H A233519 Pär Kurlberg, Florian Luca, and Igor Shparlinski <a href="http://arxiv.org/abs/1402.4464">On the fixed points of the map x -> x^x modulo a prime</a> arX1v 1402.4464
%t A233519 f[p_] := Module[{x = Range[p - 1]}, Count[PowerMod[x, x, p] - x, 0]]; Table[f[n], {n, Prime[Range[100]]}]
%Y A233519 Cf. A065295, A233518, A233520.
%K A233519 nonn
%O A233519 1,4
%A A233519 _T. D. Noe_, Feb 19 2014