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 A238542 #5 Mar 02 2014 16:05:49
%S A238542 1,2,3,5,6,11,14,20,28,40,50,72,93,124,161,213,270,355,447,573,723,
%T A238542 919,1142,1441,1786,2225,2745,3398,4160,5121,6240,7623,9255,11246,
%U A238542 13577,16423,19753,23767,28478,34125,40723,48614,57815,68740,81496,96568,114103
%N A238542 Number of partitions p of n such that 2*min(p) + (number of parts of p) is not a part of p.
%F A238542 a(n) + A097091(n) = A000041(n).
%e A238542 a(8) counts all the 22 partitions of 8 except 62 and 521.
%t A238542 Table[Count[IntegerPartitions[n], p_ /; ! MemberQ[p, Length[p] + 2*Min[p]]], {n, 50}]
%Y A238542 Cf. A097091.
%K A238542 nonn,easy
%O A238542 1,2
%A A238542 _Clark Kimberling_, Feb 28 2014