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 A284613 #4 Apr 02 2017 09:46:17
%S A284613 0,2,2,4,4,8,9,18,22,32,40,61,75,99,126,176,215,300,375,491,602,786,
%T A284613 971,1235,1491,1936,2359,2917,3499,4423,5326,6684,7956,9917,11833,
%U A284613 14511,17155,20987,24845,30387,35688,43221,50803,61535,71893,85909,100369,120887
%N A284613 Number of partitions of n such that the (sum of distinct odd parts) <= n/2.
%e A284613 a(4) counts these 4 partitions: 4, 31, 211, 1111.
%t A284613 Table[p = IntegerPartitions[n];
%t A284613 Length[Select[Table[Total[Select[DeleteDuplicates[p[[k]]], OddQ]], {k, Length[p]}], # <= n/2 &]], {n, 55}]
%Y A284613 Cf. A284612, A284614, A284615.
%K A284613 nonn,easy
%O A284613 1,2
%A A284613 _Clark Kimberling_, Mar 30 2017