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 A263401 #23 May 10 2018 09:38:29
%S A263401 1,1,0,2,0,1,3,1,1,2,6,1,4,2,5,10,5,4,9,7,8,21,9,13,13,19,13,27,32,23,
%T A263401 29,33,27,45,37,45,79,49,57,68,82,67,101,83,109,155,124,113,174,148,
%U A263401 171,196,215,198,262,310,269,330,314,342,414,430,393,536,493
%N A263401 Expansion of Product_{k>=1} (1 + x^k - x^(2*k)).
%H A263401 Vaclav Kotesovec, <a href="/A263401/b263401.txt">Table of n, a(n) for n = 0..5000</a>
%F A263401 a(n) ~ sqrt(log(phi)) * phi^sqrt(8*n) / (2^(3/4)*sqrt(Pi)*n^(3/4)), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - _Vaclav Kotesovec_, Jan 03 2016
%t A263401 nmax = 80; CoefficientList[Series[Product[1+x^k-x^(2*k), {k, 1, nmax}], {x, 0, nmax}], x]
%t A263401 nmax = 100; p = ConstantArray[0, nmax + 1]; p[[1]] = 1; p[[2]] = 1; p[[3]] = -1; Do[Do[p[[j+1]] = p[[j+1]] + p[[j - k + 1]] - If[j < 2*k, 0, p[[j - 2*k + 1]]], {j, nmax, k, -1}];, {k, 2, nmax}]; p (* _Vaclav Kotesovec_, May 10 2018 *)
%Y A263401 Cf. A000726, A002390, A055922, A100847, A109389, A162891, A266686.
%K A263401 nonn
%O A263401 0,4
%A A263401 _Vaclav Kotesovec_, Jan 03 2016