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 A026925 #7 Aug 22 2019 08:18:26 %S A026925 0,0,0,0,1,0,1,1,3,3,6,6,10,10,16,17,25,27,37,40,53,57,73,79,99,107, %T A026925 131,142,171,184,218,235,275,296,343,368,422,452,514,550,621,663,743, %U A026925 792,883,939,1041,1106,1220,1294,1421,1505,1646,1740 %N A026925 Number of partitions of n into an odd number of parts, the greatest being 5; also, a(n+9) = number of partitions of n+4 into an even number of parts, each <=5. %F A026925 a(n) + A026929(n) =A026811(n). - _R. J. Mathar_, Aug 22 2019 %Y A026925 5th column of A262920. %K A026925 nonn %O A026925 1,9 %A A026925 _Clark Kimberling_