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 A200751 #21 Sep 09 2023 12:35:22 %S A200751 1,-1,-2,-2,-3,-1,-2,6,12,36,74,162,301,599,1090,1986,3479,5993,9852, %T A200751 15644,23094,30690,31868,9068,-82372,-345308,-1010956,-2577868, %U A200751 -6098822,-13751218,-29962588,-63604140,-132205949,-269982371,-542866266,-1076420666 %N A200751 Expansion of Product_{k>0} (1 - x^k)^(2^(k-1)) in powers of x. %H A200751 Seiichi Manyama, <a href="/A200751/b200751.txt">Table of n, a(n) for n = 0..1000</a> %F A200751 Let F(a, x) = (1 - a) * (1 - a*x)^2 * (1 - a*x^2)^4 * ... where |x|<1/2. Then F(a, x) = (1 - a) * F(a*x, x)^2 and g.f. A(x) = F(x, x). %F A200751 Euler transform of [ -1, -2, -4, -8, -16, ... ]. %F A200751 G.f.: (1 - x) * (1 - x^2)^2 * (1 - x^3)^4 * ... %F A200751 Convolution inverse of A034691. %F A200751 a(0) = 1; a(n) = -(1/n) * Sum_{k=1..n} A083413(k) * a(n-k). - _Seiichi Manyama_, Jul 17 2023 %F A200751 a(n) = Sum_{k=0..2n} (-1)^k*A360634(2n,k). - _Alois P. Heinz_, Sep 09 2023 %e A200751 1 - x - 2*x^2 - 2*x^3 - 3*x^4 - x^5 - 2*x^6 + 6*x^7 + 12*x^8 + 36*x^9 + ... %t A200751 a[n_] := SeriesCoefficient[Series[Product[(1 - x^k)^2^(k - 1), %t A200751 {k, n}], {x, 0, n}], n]; Table[a[n], {n, 0, 35}] (* _T. D. Noe_, Nov 23 2011 *) %o A200751 (PARI) {a(n) = local(A); if( n<0, 0, A = x * O(x^n); polcoeff( prod( k=1, n, (1 - x^k + A) ^ 2^(k - 1)), n))} %Y A200751 Cf. A034691, A083413, A360634. %K A200751 sign %O A200751 0,3 %A A200751 _Michael Somos_, Nov 21 2011