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 A244061 #15 Mar 25 2024 00:15:29
%S A244061 1,1,2,5,14,36,90,216,507,1167,2640,5895,13020,28504,61937,133734,
%T A244061 287194,613842,1306594,2771010,5857670,12346641,25955890,54436999,
%U A244061 113924438,237949763,496101303,1032606162,2146019444,4453653132,9230534755
%N A244061 The number of digits of (2^n)!.
%t A244061 LogBase10Stirling[n_] := Floor[ Log[10, 2 Pi n]/2 + n*Log[10, n/E] + Log[10, 1 + 1/(12 n) + 1/(288 n^2) - 139/(51840 n^3) - 571/(2488320 n^4) + 163879/(209018880 n^5)]]; Table[ LogBase10Stirling[2^n] + 1, {n, 0, 30}]
%t A244061 IntegerLength[(2^Range[0,30])!] (* _Harvey P. Dale_, Nov 05 2021 *)
%Y A244061 Cf. A000722, A061010, A244060.
%K A244061 nonn,base
%O A244061 0,3
%A A244061 _Robert G. Wilson v_, Jun 18 2014