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 A265327 #4 Dec 07 2015 10:06:20 %S A265327 1,4,13,2,11,42,9,40,3,38,5,36,129,34,127,32,125,30,123,28,121,6,119, %T A265327 8,117,10,115,12,113,14,111,16,109,392,107,390,105,388,103,386,101, %U A265327 384,99,382,97,380,95,378,93,376,91,374,89,372,87,370,85,368,83 %N A265327 Smallest m such that A238324(m) = n. %C A265327 A238324(a(n)) = n and A238324(m) != n for m < a(n). %H A265327 Reinhard Zumkeller, <a href="/A265327/b265327.txt">Table of n, a(n) for n = 1..10000</a> %o A265327 (Haskell) %o A265327 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A265327 a265327 = (+ 1) . fromJust . (`elemIndex` a238324_list) %Y A265327 Cf. A238324. %K A265327 nonn %O A265327 1,2 %A A265327 _Reinhard Zumkeller_, Dec 07 2015