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 A284611 #4 Apr 02 2017 09:46:02
%S A284611 1,0,0,1,2,0,0,4,6,0,0,12,15,0,0,30,40,0,0,70,84,0,0,165,198,0,0,330,
%T A284611 405,0,0,704,836,0,0,1380,1620,0,0,2688,3192,0,0,4984,5824,0,0,9394,
%U A284611 10934,0,0,16665,19392,0,0,29970,34560,0,0,52096
%N A284611 Number of partitions of n such that the (sum of all even parts) = floor(n/2).
%e A284611 a(8) counts these 3 partitions: 44, 431, 4111.
%t A284611 Table[p = IntegerPartitions[n];
%t A284611 Length[Select[Table[Total[Select[p[[k]], EvenQ]], {k, Length[p]}], # ==
%t A284611 Floor[n/2] &]], {n, 60}]
%Y A284611 Cf. A284610, A284624, A284625.
%K A284611 nonn,easy
%O A284611 1,5
%A A284611 _Clark Kimberling_, Mar 30 2017