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 A190133 #11 Jul 13 2013 12:04:08 %S A190133 1,1886,3771,5656,7541,9059,9216,9373,9530,9687,9844,2,159,316,473, %T A190133 630,787,944,1101,1258,1415,1572,1729,1887,2044,2201,2358,2515,2672, %U A190133 2829,2986,3143,3300,3457,3614,3772,3929,4086,4243,4400,4557,4714,4871,5028,5185 %N A190133 Inverse permutation to A190132. %C A190133 a(A190132(n)) = A190132(a(n)) = n. %H A190133 Reinhard Zumkeller, <a href="/A190133/b190133.txt">Table of n, a(n) for n = 1..10000</a> (full sequence) %o A190133 (Haskell) %o A190133 import Data.List (elemIndex) %o A190133 import Data.Maybe (fromJust) %o A190133 a190133 n = a190133_list !! (n-1) %o A190133 a190133_list = %o A190133 map (succ . fromJust . (`elemIndex` a190132_list)) [1..10000] %K A190133 nonn,base,fini,full %O A190133 1,2 %A A190133 _Reinhard Zumkeller_, May 06 2011