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 A266497 #10 Apr 20 2018 17:51:43
%S A266497 1,3,9,27,79,225,627,1717,4633,12341,32501,84737,218959,561263,
%T A266497 1428287,3610671,9072367,22668285,56345835,139382713,343242533,
%U A266497 841713531,2055944117,5003148987,12132552115,29323810757,70651867863,169719163521,406541986857,971192810019
%N A266497 Binomial transform of A015128.
%H A266497 Vaclav Kotesovec, <a href="/A266497/b266497.txt">Table of n, a(n) for n = 0..3000</a>
%F A266497 a(n) ~ 2^(n-2) * exp(Pi*sqrt(n/2) + Pi^2/16) / n.
%F A266497 a(n) = [x^n] (1 + x)^n/theta_4(x), where theta_4() is the Jacobi theta function. - _Ilya Gutkovskiy_, Apr 20 2018
%t A266497 A015128[n_]:=Sum[PartitionsP[n-k]*PartitionsQ[k], {k, 0, n}];
%t A266497 Table[Sum[Binomial[n, k]*A015128[k], {k, 0, n}], {n, 0, 30}]
%Y A266497 Cf. A015128, A218481, A266232, A294499.
%K A266497 nonn
%O A266497 0,2
%A A266497 _Vaclav Kotesovec_, Dec 30 2015