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 A004233 #27 Jun 28 2024 05:26:40 %S A004233 0,1,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4, %T A004233 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5, %U A004233 5,5,5,5,5,5,5,5,5,5,5,5,5 %N A004233 a(n) = ceiling(log(n)). %C A004233 Does not satisfy Benford's law [Whyman et al., 2016]. - _N. J. A. Sloane_, Feb 12 2017 %H A004233 T. D. Noe, <a href="/A004233/b004233.txt">Table of n, a(n) for n = 1..10000</a> %H A004233 G. Whyman, N. Ohtori, E. Shulzinger, and Ed. Bormashenko, <a href="https://doi.org/10.1016/j.physa.2016.06.054">Revisiting the Benford law: When the Benford-like distribution of leading digits in sets of numerical data is expectable?</a>, Physica A: Statistical Mechanics and its Applications, 461 (2016), 595-601. %H A004233 <a href="/index/Be#Benford">Index entries for sequences related to Benford's law</a> %t A004233 Ceiling[Log[Range[100]]] (* _Paolo Xausa_, Jun 28 2024 *) %o A004233 (Haskell) %o A004233 a004233 = ceiling . log . fromIntegral -- _Reinhard Zumkeller_, Mar 17 2015 %o A004233 (PARI) a(n)=ceil(log(n)) \\ _Charles R Greathouse IV_, Apr 29 2015 %Y A004233 Cf. A000193, A000195, A000523. %K A004233 nonn %O A004233 1,3 %A A004233 _N. J. A. Sloane_