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 A284609 #15 Aug 04 2019 19:14:25
%S A284609 0,0,1,1,0,0,4,4,0,0,9,12,0,0,25,30,0,0,56,70,0,0,132,165,0,0,270,330,
%T A284609 0,0,594,704,0,0,1140,1380,0,0,2268,2688,0,0,4256,4984,0,0,8008,9394,
%U A284609 0,0,14342,16665,0,0,25920,29970,0,0,45056,52096
%N A284609 Number of partitions of n such that the (sum of all odd parts) = floor(n/2).
%C A284609 Consequently the sum of all even parts is ceiling(n/2). Therefore, a(4n + 1) = a(4n + 2) = 0. - _David A. Corneth_, Apr 02 2017
%e A284609 a(8) counts these 4 partitions: 431, 3221, 32111, 311111.
%t A284609 Table[p = IntegerPartitions[n]; Length[Select[
%t A284609 Table[Total[Select[DeleteDuplicates[p[[k]]], EvenQ]], {k,
%t A284609 Length[p]}], # == Floor[n/2] &]], {n, 60}] (* _Peter J. C. Moses_, Mar 29 2017 *)
%Y A284609 Cf. A284608, A284611.
%K A284609 nonn,easy
%O A284609 1,7
%A A284609 _Clark Kimberling_, Mar 30 2017