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 A240852 #6 May 08 2024 10:51:10
%S A240852 0,0,0,1,0,0,2,0,1,2,3,0,4,2,6,4,5,5,11,7,12,11,14,16,21,21,26,28,32,
%T A240852 37,47,46,56,64,69,81,91,101,118,131,142,163,184,201,231,258,281,319,
%U A240852 353,391,437,485,533,599,664,727,809,894,979,1091,1201,1316
%N A240852 Number of partitions p of n into distinct parts including max(p) - min(p).
%F A240852 a(n) + A240850(n) = A000009(n) for n >= 0.
%e A240852 a(10) counts these 3 partitions: 541, 532, 4321.
%t A240852 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 A240852 Table[Count[f[n], p_ /; !MemberQ[p, Max[p] - Min[p]]], {n, 0, z}] (* A240858 *)
%Y A240852 Cf. A240858, A000009.
%K A240852 nonn,easy
%O A240852 0,7
%A A240852 _Clark Kimberling_, Apr 14 2014