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 A101507 #2 Mar 31 2012 10:29:09 %S A101507 2,3,15,20,58,2893,3172,13778,36596,63894,208744,296557,404667, %T A101507 11500740,17800369,37858613,38393813,902477623,4126573365,79491128275, %U A101507 338814192247,1599109448865 %N A101507 Numbers n such that exp(n) has a smaller relative error abs(exp(n)/m!-1) in approximating the closest factorial m!>1 than exp(k) for any k with 1<k<n. %C A101507 Numbers n such that abs(exp(n)/m!-1)<abs(exp(k)/j!-1) with m such that abs(exp(n)-m!)=min for any k with 1<k<n and j such that abs(exp(k)-j!)=min. %e A101507 a(1)=2 because exp(2)=7.389 is a better approximation to the nearest factorial 3!=6 with +23% relative error than is exp(1)=2.718 for its closest factorial 2!=2 with +36% relative error. %e A101507 a(2)=3: exp(3)/4!-1=-0.1631. The next improvement occurs for a(3)=15 because exp(15)/10!-1=-0.099. %e A101507 a(22)=1599109448865: The relative error of exp(1599109448865) in approximating A101506(22)!=66836971558! is 1.276*10^(-12). %Y A101507 Cf. A101506. %K A101507 more,nonn %O A101507 1,1 %A A101507 _Hugo Pfoertner_, Dec 20 2004