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 A027357 #14 Oct 29 2019 20:06:04
%S A027357 1,0,0,0,1,1,0,1,2,1,0,1,2,2,1,2,4,3,2,3,5,5,3,5,8,6,5,7,10,10,8,11,
%T A027357 15,14,12,15,20,20,18,22,28,27,25,30,37,38,35,42,51,50,49,56,67,69,67,
%U A027357 77,90,91,90,102,117,121,121,135,155,159,160,177
%N A027357 Number of partitions of n into distinct odd parts, the greatest being congruent to 1 mod 4.
%C A027357 Also number of self-conjugate partitions of n into an odd number of parts. - _Vladeta Jovovic_, Feb 18 2004
%F A027357 a(n) = (A000700(n)-(-1)^n*A053250(n))/2. - _Vladeta Jovovic_, Mar 12 2006
%F A027357 a(n) = Sum_{k=0..floor(n/4)-1} A027356(n, 4*k+1). - _Sean A. Irvine_, Oct 28 2019
%Y A027357 Cf. A027356, A027358.
%Y A027357 Cf. A000700, A053250.
%K A027357 nonn
%O A027357 1,9
%A A027357 _Clark Kimberling_