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 A129490 #10 Nov 07 2023 03:15:45
%S A129490 1,1,1,2,3,4,7,10,15,22,32,47,67,97,138,197,280,398,565,801,1134,1607,
%T A129490 2275,3219,4555,6445,9118,12898,18243,25803,36494,51615,72998,103238,
%U A129490 146005,206486,292020,412982,584050,825975,1168110,1651962,2336232
%N A129490 Number of digits in the decimal expansion of the number of partitions of 2^n.
%C A129490 For the same sequence but for base 10 (A070177): A077644.
%F A129490 See A000041: (Hardy and Ramanujan) & (Ayoub, p. 197).
%F A129490 a(n) = A055642(A068413(n)).
%F A129490 a(n) =~ 2*A129491(n)/9.
%t A129490 f[n_] := Floor[ Log[10, PartitionsP[2^n]] + 1]; Table[ f@n, {n, 0, 42}]
%Y A129490 Cf. A000041, A068413, A077644, A129491.
%K A129490 base,nonn
%O A129490 0,4
%A A129490 _Robert G. Wilson v_, Apr 11 2007
%E A129490 Missing a(0) prepended by _Georg Fischer_, Nov 06 2023