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 A161597 #20 May 11 2015 21:58:53
%S A161597 1,2,3,4,5,6,7,8,9,11,13,17,19,22,23,26,29,31,33,37,39,41,43,44,46,47,
%T A161597 53,55,59,61,62,66,67,69,71,73,77,79,82,83,86,88,89,93,97,99,101,103,
%U A161597 107,109,113,121,127,131,137,139,143,149,151,157,163,167,169,173,179
%N A161597 Numbers such that TITO(n) = n, where TITO(n) = A161594(n).
%C A161597 TITO(p) = p, for any prime p.
%H A161597 Reinhard Zumkeller, <a href="/A161597/b161597.txt">Table of n, a(n) for n = 1..10000</a>
%H A161597 T. Khovanova, <a href="http://blog.tanyakhovanova.com/?p=144">Turning Numbers Inside Out</a> [From _Tanya Khovanova_, Jul 07 2009]
%t A161597 reversepower[{n_, k_}] := FromDigits[Reverse[IntegerDigits[n]]]^k f[n_] := FromDigits[ Reverse[IntegerDigits[Times @@ Map[reversepower, FactorInteger[n]]]]] Select[Range[200], f[ # ] == # &]
%o A161597 (Haskell)
%o A161597 a161597 n = a161597_list !! (n-1)
%o A161597 a161597_list = filter (\x -> a161594 x == x) [1..]
%o A161597 -- _Reinhard Zumkeller_, Oct 14 2011
%o A161597 (PARI) is(n)={n==A161594(n)} \\ _M. F. Hasler_, May 11 2015
%Y A161597 Complement of A161598; nonprimes: A161600.
%K A161597 nonn,base
%O A161597 1,2
%A A161597 _J. H. Conway_ & _Tanya Khovanova_, Jun 14 2009
%E A161597 Edited by _N. J. A. Sloane_, Jun 23 2009
%E A161597 Offset corrected by _Reinhard Zumkeller_, Oct 14 2011