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 A026932 #15 Feb 19 2025 12:20:22
%S A026932 0,1,1,0,1,1,1,2,3,3,0,1,2,3,3,1,2,4,5,6,6,0,2,3,5,6,7,7,1,3,6,8,10,
%T A026932 11,12,12,0,2,5,8,10,12,13,14,14,1,3,8,12,16,18,20,21,22,22,0,3,7,13,
%U A026932 17,21,23,25,26,27,27,1,4,11,18,25,30,34,36,38
%N A026932 Triangular array T read by rows: T(n,k) = number of partitions of n into an even number of parts, each <= k.
%H A026932 Paul Barry, <a href="https://doi.org/10.3390/math13020242">Extensions of Riordan Arrays and Their Applications</a>, Mathematics (2025) Vol. 13, No. 2, 242. See p. 20.
%F A026932 T(n, k) = Sum_{i=1..k} A026921(n, i).
%Y A026932 Cf. A026921.
%K A026932 nonn,tabl
%O A026932 1,8
%A A026932 _Clark Kimberling_