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 A208852 #8 Jul 13 2013 12:04:23 %S A208852 1,7,2,6,10,3,48,5,21,9,44,81,27,47,55,11,16,20,1058,364,745,43,300, %T A208852 80,69,26,24,46,5901,54,22,59,32,17,30,19,568076,1057,75,363,28,744, %U A208852 87,42,169,299,40,79,315,68,186,25,101,23,38,45,2924,5900,413,53 %N A208852 Smallest m such that A090895(m) = n. %C A208852 A090895(a(n)) = n and A090895(m) <> n for m < a(n). %H A208852 Reinhard Zumkeller, <a href="/A208852/b208852.txt">Table of n, a(n) for n = 1..1097</a> %o A208852 (Haskell) %o A208852 import Data.List (elemIndex) %o A208852 import Data.Maybe (fromJust) %o A208852 a208852 = (+ 1) . fromJust . (`elemIndex` a090895_list) %K A208852 nonn %O A208852 1,2 %A A208852 _Reinhard Zumkeller_, Mar 02 2012