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 A261175 #33 Jan 10 2022 15:43:20
%S A261175 1,1,1,3,5,8,13,19,26,35,45,56,69,84,100,117,137,158,180,204,231,258,
%T A261175 288,319,352,387,424,463,503,546,590,636,684,734,786,840,897,955,1015,
%U A261175 1077,1141,1207,1275,1345,1418,1492,1568,1647,1728,1811,1896,1983,2072,2163,2257,2352
%N A261175 Number of digits of Hyperfactorial(n).
%H A261175 Chai Wah Wu, <a href="/A261175/b261175.txt">Table of n, a(n) for n = 0..1000</a>
%F A261175 a(n) = 1 + floor( log_10( A002109(n))) = A055642(A002109(n)).
%t A261175 Table[1 + Floor@ Log10@ Hyperfactorial@ n, {n, 0, 55}]
%o A261175 (PARI) a(n)=my(r=1);for(i=1,n+1,r *= i^i);floor(log(r)/log(10))+1 \\ _Anders Hellström_, Aug 20 2015
%o A261175 (PARI) vector(60, n, n--; #Str(prod(k=2, n, k^k))) \\ _Michel Marcus_, Aug 20 2015
%o A261175 (Python)
%o A261175 A261175_list, n = [], 1
%o A261175 for i in range(100):
%o A261175 n *= i**i
%o A261175 A261175_list.append(len(str(n))) # _Chai Wah Wu_, Aug 21 2015
%Y A261175 Cf. A002109, A061010, A260262.
%K A261175 nonn
%O A261175 0,4
%A A261175 _Robert G. Wilson v_, Aug 20 2015