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 A284610 #11 Aug 04 2019 19:17:11
%S A284610 1,0,0,2,3,0,0,3,4,0,0,15,20,0,0,23,31,0,0,55,70,0,0,153,195,0,0,265,
%T A284610 335,0,0,535,664,0,0,988,1208,0,0,2242,2750,0,0,3580,4332,0,0,6941,
%U A284610 8349,0,0,11621,13909,0,0,20681,24585,0,0,37202
%N A284610 Number of partitions of n such that the (sum of distinct even parts) = floor(n/2).
%e A284610 a(5) counts these 3 partitions: 32, 221, 2111.
%t A284610 Table[p = IntegerPartitions[n];
%t A284610 Length[Select[Table[Total[Select[DeleteDuplicates[p[[k]]], EvenQ]], {k, Length[p]}], # == Floor[n/2] &]], {n, 60}](* _Peter J. C. Moses_, Mar 29 2017 *)
%Y A284610 Cf. A284608, A284616, A284617.
%K A284610 nonn,easy
%O A284610 1,4
%A A284610 _Clark Kimberling_, Mar 30 2017