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 A194233 #9 Jan 29 2014 07:48:50 %S A194233 10,20,30,40,50,60,70,80,90,100,110,21,31,41,51,61,71,81,91,200,210, %T A194233 220,32,42,52,62,72,82,92,300,310,320,330,43,53,63,73,83,93,400,410, %U A194233 420,430,440,54,64,74,84,94,500,510,520,530,540,550,65,75,85,95 %N A194233 Smallest number greater than n with exactly the same digits as n in decimal representation, a(n)=10*n if no such number exists. %C A194233 A004186(a(n)) = A004186(n) or A004186(a(n)) = 10*A004186(n). %H A194233 Reinhard Zumkeller, <a href="/A194233/b194233.txt">Table of n, a(n) for n = 1..10000</a> %o A194233 (Haskell) %o A194233 import Data.List (find); import Data.Maybe (fromMaybe) %o A194233 a194233 n = %o A194233 fromMaybe (10*n) $ find (== a004186 n) $ map a004186 [n+1..10*n] %K A194233 nonn,base,look %O A194233 1,1 %A A194233 _Reinhard Zumkeller_, Aug 19 2011