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 A238543 #4 Mar 02 2014 16:06:05
%S A238543 1,2,3,5,7,10,15,21,29,39,54,73,96,126,167,217,281,359,461,587,744,
%T A238543 935,1176,1470,1832,2271,2814,3465,4262,5219,6383,7777,9456,11458,
%U A238543 13869,16733,20155,24208,29040,34743,41508,49473,58886,69944,82964,98208,116113
%N A238543 Number of partitions p of n such that 3*min(p) + (number of parts of p) is not a part of p.
%F A238543 a(n) + A097092(n) = A000041(n).
%e A238543 a(10) counts all the 42 partitions of 10 except these: 82, 7111, 631.
%t A238543 Table[Count[IntegerPartitions[n], p_ /; ! MemberQ[p, Length[p] + 3*Min[p]]], {n, 50}]
%Y A238543 Cf. A097092.
%K A238543 nonn,easy
%O A238543 1,2
%A A238543 _Clark Kimberling_, Feb 28 2014