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 A284617 #4 Apr 03 2017 20:32:09
%S A284617 1,1,2,4,6,8,11,17,23,29,38,63,81,102,131,186,235,293,364,503,622,762,
%T A284617 933,1287,1571,1906,2311,3049,3682,4425,5305,6874,8219,9796,11648,
%U A284617 14796,17543,20743,24484,31059,36600,43025,50477,62681,73401,85788,100085
%N A284617 Number of partitions of n such that the (sum of distinct even parts) <= n/2.
%e A284617 a(4) counts these 4 partitions: 31, 22, 211, 1111.
%t A284617 Table[p = IntegerPartitions[n];
%t A284617 Length[Select[Table[Total[Select[DeleteDuplicates[p[[k]]], EvenQ]], {k,
%t A284617 Length[p]}], # <= n/2 &]], {n, 54}]
%Y A284617 Cf. A284616, A284618, A284619.
%K A284617 nonn,easy
%O A284617 1,3
%A A284617 _Clark Kimberling_, Apr 02 2017