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 A026931 #10 Oct 17 2019 19:18:52
%S A026931 1,0,1,1,1,2,0,1,1,2,1,2,3,3,4,0,2,3,4,4,5,1,2,5,6,7,7,8,0,2,4,7,8,9,
%T A026931 9,10,1,3,7,10,13,14,15,15,16,0,3,6,11,14,17,18,19,19,20,1,3,9,14,20,
%U A026931 23,26,27,28,28,29,0,3,8,16,22,28,31,34,35,36
%N A026931 Triangular array T read by rows: T(n,k) = number of partitions of n into an odd number of parts, each <= k.
%F A026931 T(n, k) = Sum_{i=1..k} A026920(n, i).
%K A026931 nonn,tabl
%O A026931 1,6
%A A026931 _Clark Kimberling_