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 A129491 #13 Sep 21 2024 02:27:50
%S A129491 1,2,5,4,6,24,22,34,83,120,152,145,286,477,561,796,1271,1639,2471,
%T A129491 3598,5114,7221,10283,14315,20585,29110,40890,58834,82319,115690,
%U A129491 164128,232044,328463,462853,657811,927235,1311605,1855787,2629927,3708205
%N A129491 Digital sum of the 2^n-th partition number.
%C A129491 For the same sequence but for base 10 (A070177): 1,6,43,143,471,1511,4959,15914,49580,158148,501883,1582908,5014367,....
%F A129491 a(n) = A007953(A000041(A000079(n))) = A007953(A068413(n)).
%F A129491 a(n) =~ 9*A129490(n)/2.
%e A129491 a(9) = 120 since P(2^9) = 4453575699570940947378 and 4+4+5+3+5+7+5+6+9+9+5+7+0+9+4+0+9+4+7+3+7+8 = 120.
%t A129491 f[n_] := Plus @@ IntegerDigits @PartitionsP[2^n]; Table[ f@n, {n, 0, 42}]
%Y A129491 Cf. A000041, A000079, A007953, A068413, A129490.
%K A129491 base,nonn
%O A129491 0,2
%A A129491 _Robert G. Wilson v_, Apr 12 2007
%E A129491 Offset corrected by _Alois P. Heinz_, Sep 20 2024