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 A304909 #6 May 21 2018 11:27:42
%S A304909 0,1,4,6,16,20,36,42,80,90,140,154,240,260,364,390,576,612,828,874,
%T A304909 1200,1260,1628,1702,2256,2350,2964,3078,3920,4060,4980,5146,6464,
%U A304909 6666,8092,8330,10224,10508,12540,12870,15600,15990,18900,19350,23056,23580,27508,28106,33216,33908
%N A304909 Expansion of x * (d/dx) Product_{k>=0} 1/(1 - x^(2^k)).
%C A304909 Sum of all parts of all partitions of n into powers of 2.
%C A304909 Convolution of the sequences A018819 and A038712.
%H A304909 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A304909 G.f.: x * (d/dx) Product_{k>=0} (1 + x^(2^k))^(k+1).
%F A304909 G.f.: Sum_{i>=0} 2^i*x^(2^i)/(1 - x^(2^i)) * Product_{j>=0} 1/(1 - x^(2^j)).
%F A304909 a(n) = n*A018819(k).
%t A304909 nmax = 49; CoefficientList[Series[x D[Product[1/(1 - x^2^k), {k, 0, Floor[Log[nmax]/Log[2]] + 1}], x], {x, 0, nmax}], x]
%t A304909 nmax = 49; CoefficientList[Series[x D[Product[(1 + x^2^k)^(k + 1), {k, 0, Floor[Log[nmax]/Log[2]] + 1}], x], {x, 0, nmax}], x]
%t A304909 a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d Boole[d == 2^IntegerExponent[d, 2]], {d, Divisors[k]}] a[n - k], {k, 1, n}]/n]; Table[n a[n], {n, 0, 49}]
%Y A304909 Cf. A000079, A000123, A018819, A038712, A066186, A281688, A304908.
%K A304909 nonn
%O A304909 0,3
%A A304909 _Ilya Gutkovskiy_, May 20 2018