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 A241752 #4 Apr 28 2014 02:21:06 %S A241752 1,3,95,8,22,121,144,24,27,60,67,73,66,79,163,196,148,150,220,80,181, %T A241752 173,178,197,213,203,194,202,261,374,304,387,645,295,447,379,290,420, %U A241752 362,506,515,878,520,836,941,495,594,754,884,958,501,485,561,407,467 %N A241752 Smallest number m such that A229037(m) = n. %C A241752 A229037(a(n)) = n and A229037(m) <> n for m < a(n). %H A241752 Reinhard Zumkeller, <a href="/A241752/b241752.txt">Table of n, a(n) for n = 1..1000</a> %o A241752 (Haskell) %o A241752 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A241752 a241752 = (+ 1) . fromJust . (`elemIndex` a229037_list) %K A241752 nonn %O A241752 1,2 %A A241752 _Reinhard Zumkeller_, Apr 28 2014