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 A279715 #10 Sep 08 2022 08:46:18
%S A279715 1,2,4,6,10,16,23,34,50,70,98,136,184,250,336,444,586,768,997,1290,
%T A279715 1660,2120,2698,3420,4310,5414,6776,8442,10488,12986,16020,19710,
%U A279715 24180,29574,36082,43910,53293,64538,77980,94000,113082,135760,162648,194502,232164
%N A279715 Expansion of a q-series used by Ramanujan in his Lost Notebook.
%D A279715 Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, page 1, 1st equation with a=1.
%H A279715 G. C. Greubel, <a href="/A279715/b279715.txt">Table of n, a(n) for n = 0..1000</a>
%F A279715 G.f.: Sum_{k>=0} x^k * (1 + x) * (1 + x^2) * ... * (1 + x^k) / ((1 - x) * (1 - x^3) * ... * (1 - x^(2*k+1))).
%e A279715 G.f. = 1 + 2*x + 4*x^2 + 6*x^3 + 10*x^4 + 16*x^5 + 23*x^6 + 34*x^7 + ...
%t A279715 a[ n_] := SeriesCoefficient[ Sum[ x^k QPochhammer[ -x, x, k] / QPochhammer[ x, x^2, k + 1] // FunctionExpand, {k, 0, n}], {x, 0, n}];
%o A279715 (PARI) {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( sum(k=0, n, x^k * prod(i=1, k, 1 + x^i, 1 + A) / prod(i=1, k+1, 1 - x^(2*i-1), 1 + A), A), n))};
%o A279715 (Magma) m:=50; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&+[x^k* (&*[(1+x^j): j in [0..k]])/(&*[(1-x^(2*s+1)): s in [0..k]]) : k in [0..(m+2)]])/2 )); // _G. C. Greubel_, Nov 12 2018
%Y A279715 Cf. A256209.
%K A279715 nonn
%O A279715 0,2
%A A279715 _Michael Somos_, Dec 17 2016