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 A238480 #6 Feb 27 2014 20:22:47
%S A238480 1,2,2,3,2,5,3,6,8,9,10,20,18,25,38,43,53,77,87,114,150,176,220,290,
%T A238480 343,422,535,641,783,978,1164,1415,1733,2068,2497,3026,3595,4304,5174,
%U A238480 6140,7300,8709,10283,12176,14435,16978,20001,23579,27640,32423,38024
%N A238480 Number of partitions p of n that include (min(p) + max(p))/2 as a part.
%C A238480 A238480(n) + A238481(n) = A000041(n).
%e A238480 a(6) counts these partitions:
%e A238480 6 (as (6+6)/2 = 6 is included),
%e A238480 33 (as (3+3)/2 = 3 is included),
%e A238480 321 (as (3+1)/2 = 2 is included),
%e A238480 222 (as (2+2)/2 = 2 is included),
%e A238480 111111 (as (1+1)/2 = 1 is included).
%e A238480 Thus a(6) = 5.
%t A238480 Table[Count[IntegerPartitions[n], p_ /; MemberQ[p, (Min[p] + Max[p])/2]], {n, 40}]
%Y A238480 Cf. A238481.
%K A238480 nonn,easy
%O A238480 1,2
%A A238480 _Clark Kimberling_, Feb 27 2014