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 A008905 #59 Jan 05 2025 19:51:34 %S A008905 1,1,2,6,2,1,7,5,4,3,3,3,4,6,8,1,2,3,6,1,2,5,1,2,6,1,4,1,3,8,2,8,2,8, %T A008905 2,1,3,1,5,2,8,3,1,6,2,1,5,2,1,6,3,1,8,4,2,1,7,4,2,1,8,5,3,1,1,8,5,3, %U A008905 2,1,1,8,6,4,3,2,1,1,1,8,7,5,4,3,3,2,2,2,1,1,1,1,1,1,1,1,9,9,9,9,9,9,9,9,1 %N A008905 Leading digit of n!. %C A008905 Kunoff proved that the distribution of terms of this sequence follows Benford's law, i.e., the asymptotic density of terms with value d (between 1 and 9) is log_10(1+1/d). - _Amiram Eldar_, Sep 23 2019 %H A008905 Seiichi Manyama, <a href="/A008905/b008905.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..1000 from T. D. Noe) %H A008905 Sharon Kunoff, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/25-4/kunoff.pdf">N! has the first digit property</a>, The Fibonacci Quarterly, Vol. 25, No. 4 (1987), pp. 365-367. %H A008905 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a> %F A008905 a(n) = A000030(A000142(n)). - _Reinhard Zumkeller_, Apr 08 2012 %t A008905 f[n_] := Quotient[n!, 10^Floor@ Log[10, n!]]; Array[f, 105, 0] %o A008905 (Haskell) %o A008905 a008905 = a000030 . a000142 -- _Reinhard Zumkeller_, Apr 08 2012 %Y A008905 Cf. A000966, A000142, A018799, A202021 (leading digit of (10^n)!), A213201. %K A008905 nonn,base,easy %O A008905 0,3 %A A008905 _Russ Cox_ %E A008905 Two less-efficient Mathematica codings removed by _Robert G. Wilson v_, Nov 05 2010