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 A284608 #11 Aug 04 2019 19:15:52
%S A284608 0,1,2,0,0,1,2,5,6,1,3,8,9,1,5,20,20,28,45,30,29,43,69,60,51,119,174,
%T A284608 86,75,213,307,355,375,416,583,517,541,663,923,1198,1291,1205,1650,
%U A284608 2156,2365,1803,2469,4196,4596,4637,6073,6684,7374,6740,8829,12345
%N A284608 Number of partitions of n such that the (sum of distinct odd parts) = floor(n/2).
%e A284608 a(8) counts these 5 partitions: 431, 3311, 3221, 32111, 311111.
%t A284608 Table[p = IntegerPartitions[n]; Length[Select[Table[Total[Select[DeleteDuplicates[p[[k]]], OddQ]], {k, Length[p]}], # == Floor[n/2] &]], {n, 60}] (* _Peter J. C. Moses_, Mar 29 2017 *)
%Y A284608 Cf. A284609, A284610, A284612, A284613.
%K A284608 nonn,easy
%O A284608 1,3
%A A284608 _Clark Kimberling_, Mar 30 2017