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 A294846 #9 Nov 14 2017 17:41:15
%S A294846 1,-1,-2,-4,0,3,17,24,40,9,-24,-149,-250,-435,-395,-281,514,1528,3542,
%T A294846 5127,6920,5416,1368,-11136,-28533,-57051,-82846,-107315,-95655,
%U A294846 -43646,107826,345877,727771,1150968,1601729,1766547,1495154,183944,-2339567,-6770991,-12701854
%N A294846 Expansion of Product_{k>=1} 1/(1 + x^k)^(k*(k+1)/2).
%C A294846 Convolution inverse of A028377.
%C A294846 This sequence is obtained from the generalized Euler transform in A266964 by taking f(n) = n*(n+1)/2, g(n) = -1. - _Seiichi Manyama_, Nov 14 2017
%H A294846 Seiichi Manyama, <a href="/A294846/b294846.txt">Table of n, a(n) for n = 0..10000</a>
%F A294846 G.f.: Product_{k>=1} 1/(1 + x^k)^A000217(k).
%F A294846 a(0) = 1 and a(n) = (1/(2*n)) * Sum_{k=1..n} b(k)*a(n-k) where b(n) = Sum_{d|n} d^2*(d+1)*(-1)^(n/d). - _Seiichi Manyama_, Nov 14 2017
%t A294846 nmax = 40; CoefficientList[Series[Product[1/(1 + x^k)^(k (k + 1)/2), {k, 1, nmax}], {x, 0, nmax}], x]
%t A294846 a[n_] := a[n] = If[n == 0, 1, -Sum[Sum[(-1)^(k/d + 1) d^2 (d + 1)/2, {d, Divisors[k]}] a[n - k], {k, 1, n}]/n]; Table[a[n], {n, 0, 40}]
%Y A294846 Cf. A000217, A000294, A028377, A255528, A284896, A292386.
%K A294846 sign
%O A294846 0,3
%A A294846 _Ilya Gutkovskiy_, Nov 09 2017