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 A161600 #21 May 11 2015 19:25:00
%S A161600 1,4,6,8,9,22,26,33,39,44,46,55,62,66,69,77,82,86,88,93,99,121,143,
%T A161600 169,187,202,206,226,242,252,253,262,286,299,303,309,339,341,343,363,
%U A161600 393,404,422,446,451,466,473,482,484,505,525,583,606,616,622,626,633,662,669,671,682,686
%N A161600 Nonprime numbers such that TITO(n) = n, where TITO(n) = A161594(n).
%H A161600 Reinhard Zumkeller, <a href="/A161600/b161600.txt">Table of n, a(n) for n = 1..10000</a>
%H A161600 T. Khovanova, <a href="http://blog.tanyakhovanova.com/?p=144">Turning Numbers Inside Out</a> [From _Tanya Khovanova_, Jul 07 2009]
%t A161600 reversepower[{n_, k_}] := FromDigits[Reverse[IntegerDigits[n]]]^k; f[n_] := FromDigits[Reverse[IntegerDigits[Times @@ Map[reversepower, FactorInteger[n]]]]]; Select[Range[600], f[#] == # && ! PrimeQ[#] &]
%o A161600 (Haskell)
%o A161600 a161600 n = a161600_list !! (n-1)
%o A161600 a161600_list = filter ((== 0) . a010051) a161597_list
%o A161600 -- _Reinhard Zumkeller_, Oct 14 2011
%o A161600 (PARI) is(n)=!isprime(n)&&n==A161594(n) \\ _M. F. Hasler_, May 11 2015
%Y A161600 Cf. A010051, A161594; subsequence of A161597.
%K A161600 nonn,base
%O A161600 1,2
%A A161600 _J. H. Conway_ & _Tanya Khovanova_, Jun 14 2009
%E A161600 Edited by _N. J. A. Sloane_, Jun 23 2009
%E A161600 Offset corrected by _Reinhard Zumkeller_, Oct 14 2011
%E A161600 Minor edits and more displayed terms from _M. F. Hasler_, May 11 2015