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 A027347 #13 Feb 17 2021 11:02:39
%S A027347 1,0,0,1,1,1,0,1,2,1,1,2,3,2,2,3,4,3,3,5,6,6,5,7,9,8,8,11,12,12,12,15,
%T A027347 18,17,18,22,25,25,26,30,34,34,36,42,47,48,50,57,64,65,69,78,85,89,93,
%U A027347 104,114,118,125,139,151,157,166,183,198,207,219,240
%N A027347 Number of partitions of n into distinct odd parts, the least being congruent to 1 mod 4.
%F A027347 From _Peter Bala_, Jan 31 2021: (Start)
%F A027347 G.f.: A(q) = Sum_{n >= 0} q^(4*n+1) * Product_{k >= 2*n+1} 1 + q^(2*k+1).
%F A027347 A(q) = Limit_{N -> oo} Sum_{n = 0..2*N+1} (-1)^n * Product_{k = n..2*N+1} 1 + q^(2*k+1) = Limit_{N -> oo} Sum_{n = 0..2*N+1} (-1)^n * Product_{k >= n} 1 + q^(2*k+1). (End)
%p A027347 G := add( q^(4*n+1)*mul( 1 + q^(2*k+1), k = 2*n+1..50 ), n = 0..25 ):
%p A027347 S := series(G, q, 101):
%p A027347 seq(coeff(S, q, j), j = 1..100); # _Peter Bala_, Jan 31 2021
%Y A027347 Cf. A026832.
%K A027347 nonn,easy
%O A027347 1,9
%A A027347 _Clark Kimberling_