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 A295866 #37 Mar 04 2018 19:49:49
%S A295866 1,1,1,1,1,1,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,5,
%T A295866 5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,
%U A295866 7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8
%N A295866 Number of decimal digits in the number of partitions of n.
%C A295866 In his book on analytic number theory, Don Newman tells this amusing story regarding the number of digits in p(n): "This is told of Major MacMahon who kept a list of these partition numbers arranged one under another up into the hundreds. It suddenly occurred to him that, viewed from a distance, the outline of the digits seemed to form a parabola! Thus the number of digits in p(n), the number of partitions of n, is around C*sqrt(n), or p(n) itself is very roughly e^(a*sqrt(n)). The first crude assessment of p(n)!"
%D A295866 D. J. Newman, Analytic number theory, Springer Verlag, 1998, p. 17.
%F A295866 a(n) = A055642(A000041(n)).
%t A295866 Join[{1}, IntegerLength[PartitionsP[#]] & /@ Range[99]]
%o A295866 (PARI) a(n) = #digits(numbpart(n)); \\ _Michel Marcus_, Feb 17 2018
%Y A295866 Cf. A000041, A055642, A072212, A097985.
%K A295866 nonn,base
%O A295866 0,7
%A A295866 _José Hernández_, Feb 13 2018