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 A027350 #17 Oct 09 2018 09:58:58
%S A027350 0,0,1,0,0,0,0,1,0,1,0,1,0,1,1,1,1,1,2,1,2,1,3,2,3,2,4,3,4,4,5,5,5,6,
%T A027350 7,8,7,9,9,11,10,13,13,15,14,17,18,21,20,23,25,27,28,31,34,36,38,41,
%U A027350 46,48,51,54,61,63,68,72,80,83,89,94,104,109,116
%N A027350 Number of partitions of n into distinct odd parts, the least being 3.
%H A027350 Charles R Greathouse IV, <a href="/A027350/b027350.txt">Table of n, a(n) for n = 1..10000</a>
%F A027350 G.f. sum(n>=2, x^(n^2-1)/prod(k=1,n-2,1-x^(2*k))) - _Joerg Arndt_, Jan 29 2011
%F A027350 a(n) ~ exp(Pi*sqrt(n/6)) / (2^(15/4) * 3^(1/4) * n^(3/4)). - _Vaclav Kotesovec_, Oct 09 2018
%o A027350 (PARI)
%o A027350 N=99;x='x+O('x^N);
%o A027350 t=sum(n=2,N,x^(n^2-1)/prod(k=1,n-2,1-x^(2*k))); /* == x^3 + x^8 + x^10 + ... */
%o A027350 v=Vec(t) /* show terms for n>=3 */ /* Joerg Arndt, Jan 29 2011 */
%Y A027350 Cf. A027349.
%K A027350 nonn
%O A027350 1,19
%A A027350 _Clark Kimberling_