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 A027359 #17 Oct 29 2019 22:01:38
%S A027359 1,0,0,0,0,1,0,0,1,1,0,0,0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,1,1,
%T A027359 2,2,0,0,0,0,1,1,1,1,2,0,0,0,0,0,0,1,1,2,2,0,0,0,0,0,0,1,1,1,1,2,0,0,
%U A027359 0,0,0,0,1,1,2,2,3,3,0,0,0,0,0,0,1,1,2,2,2,2,3,0,0,0,0,0,0,0,0,1,1,2,2,3,3,0,0,0,0,0,0,1,1,2,2,3,3,3,3,4
%N A027359 Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, all <= k.
%H A027359 Alois P. Heinz, <a href="/A027359/b027359.txt">Rows n = 1..361, flattened</a>
%F A027359 T(n, k) = Sum_{j=1..k} A027356(n, j). - _Sean A. Irvine_, Oct 29 2019
%Y A027359 Cf. A027356.
%K A027359 nonn,look,tabl
%O A027359 1,35
%A A027359 _Clark Kimberling_