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 A182061 #11 Mar 12 2015 12:53:01 %S A182061 1,2,3,4,5,7,10,11,17,22,23,41,46,47,83,94,139,167,235,283,359,517, %T A182061 659,719,1081,1319,1439,2209,2878,2879,5756,5758,8637,11516,14395, %U A182061 20147,28790,31669,48943,61993,66217,103823,132434,135313,238957,270626,397303 %N A182061 Smallest number with "natural" logarithm n, cf. A061373. %C A182061 Corresponding to A061373 like A005520 to A005245; A061373(a(n)) = n and A061373(m) < n for m < a(n). %H A182061 <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a> %o A182061 (Haskell) %o A182061 import Data.List (elemIndex) %o A182061 import Data.Maybe (fromJust) %o A182061 a182061 = (+ 1) . fromJust . (`elemIndex` a061373_list) %K A182061 nonn %O A182061 1,2 %A A182061 _Reinhard Zumkeller_, Apr 09 2012