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