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 A161598 #15 Nov 04 2013 13:13:09
%S A161598 10,12,14,15,16,18,20,21,24,25,27,28,30,32,34,35,36,38,40,42,45,48,49,
%T A161598 50,51,52,54,56,57,58,60,63,64,65,68,70,72,74,75,76,78,80,81,84,85,87,
%U A161598 90,91,92,94,95,96,98,100,102,104,105,106,108,110,111,112,114,115,116
%N A161598 Numbers such that TITO(n) is not equal to n, where TITO(n) = A161594(n).
%C A161598 There are no prime numbers in the sequence: A010051(a(n)) = 0.
%H A161598 Reinhard Zumkeller, <a href="/A161598/b161598.txt">Table of n, a(n) for n = 1..10000</a>
%H A161598 T. Khovanova, <a href="http://blog.tanyakhovanova.com/?p=144">Turning Numbers Inside Out</a> [From _Tanya Khovanova_, Jul 07 2009]
%t A161598 reversepower[{n_, k_}] := FromDigits[Reverse[IntegerDigits[n]]]^k f[n_] := FromDigits[ Reverse[IntegerDigits[Times @@ Map[reversepower, FactorInteger[n]]]]] Select[Range[200], f[ # ] != # &]
%o A161598 (Haskell)
%o A161598 a161598 n = a161598_list !! (n-1)
%o A161598 a161598_list = filter (\x -> a161594 x /= x) [1..]
%o A161598 -- _Reinhard Zumkeller_, Oct 14 2011
%Y A161598 Complement of A161597.
%K A161598 nonn,base
%O A161598 1,1
%A A161598 _J. H. Conway_ & _Tanya Khovanova_, Jun 14 2009
%E A161598 Edited by _N. J. A. Sloane_, Jun 23 2009
%E A161598 Offset corrected by _Reinhard Zumkeller_, Oct 14 2011