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 A026930 #9 May 04 2025 17:46:52
%S A026930 0,0,0,0,0,0,1,1,2,2,4,5,7,9,14,17,23,28,37,44,56,66,83,98,119,139,
%T A026930 168,194,229,263,309,352,408,462,532,600,683,766,869,969,1090,1211,
%U A026930 1356,1500,1670,1840,2041,2242,2473,2707,2978,3249
%N A026930 Number of partitions of n into an even number of parts, the greatest being 6; also, a(n+11) = number of partitions of n+5 into an odd number of parts, each <=6.
%t A026930 Table[Count[IntegerPartitions[n],_?(EvenQ[Length[#]]&&#[[1]]==6&)],{n,60}] (* _Harvey P. Dale_, May 04 2025 *)
%Y A026930 6th column of A026921.
%K A026930 nonn
%O A026930 1,9
%A A026930 _Clark Kimberling_