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 A281852 #4 Feb 05 2017 13:17:04
%S A281852 0,1,1,3,5,9,18,29,55,91,163,274,472,798,1349,2275,3804,6380,10614,
%T A281852 17685,29318,48584,80296,132506,218329,359139,590092,968120,1586707,
%U A281852 2597349,4247619,6939353,11326636,18471726,30099313,49008929,79739345,129650164,210661777,342080831,555153086,900432434,1459670289
%N A281852 Expansion of Sum_{p prime, i>=1} x^(p^i) / (1 - Sum_{p prime, j>=1} x^(p^j))^2.
%C A281852 Total number of parts in all compositions (ordered partitions) of n into prime powers (1 excluded).
%H A281852 <a href="/index/Com#comp">Index entries for sequences related to compositions</a>
%F A281852 G.f.: Sum_{p prime, i>=1} x^(p^i) / (1 - Sum_{p prime, j>=1} x^(p^j))^2.
%e A281852 a(7) = 18 because we have [7], [5, 2], [4, 3], [3, 4], [3, 2, 2], [2, 5], [2, 3, 2], [2, 2, 3] and 1 + 2 + 2 + 2 + 3 + 2 + 3 + 3 = 18.
%t A281852 nmax = 43; Rest[CoefficientList[Series[Sum[Floor[1/PrimeNu[i]] x^i, {i, 2, nmax}]/(1 - Sum[Floor[1/PrimeNu[j]] x^j, {j, 2, nmax}])^2, {x, 0, nmax}], x]]
%Y A281852 Cf. A121304, A246655, A280195.
%K A281852 nonn
%O A281852 1,4
%A A281852 _Ilya Gutkovskiy_, Jan 31 2017