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 A240858 #7 Sep 27 2014 04:58:57
%S A240858 0,1,1,1,2,3,2,5,5,6,7,12,11,16,16,23,27,33,35,47,52,65,75,88,101,121,
%T A240858 139,164,190,219,249,294,334,384,443,504,577,659,746,851,971,1097,
%U A240858 1242,1409,1585,1790,2023,2271,2557,2873,3221,3612,4049,4521,5054,5651
%N A240858 Number of partitions p of n into distinct parts not including max(p) - min(p).
%F A240858 a(n) + A240852(n) = A000009(n) for n >= 0.
%e A240858 a(10) counts all 10 partitions of 10 into distinct parts except for 541, 532, 4321, so that a(10) = 7.
%t A240858 z = 40; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; Table[Count[f[n], p_ /; MemberQ[p, Max[p] - Min[p]]], {n, 0, z}] (* A240852 *)
%t A240858 Table[Count[f[n], p_ /; !MemberQ[p, Max[p] - Min[p]]], {n, 0, z}] (* A240858 *)
%Y A240858 Cf. A240852, A000009.
%K A240858 nonn,easy
%O A240858 0,5
%A A240858 _Clark Kimberling_, Apr 14 2014