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 A238708 #17 Jan 01 2022 17:55:35
%S A238708 0,0,0,1,0,1,1,2,2,3,4,5,6,8,10,13,15,19,23,28,33,41,48,58,68,81,95,
%T A238708 113,131,154,179,209,241,281,323,374,429,494,565,649,739,845,961,1095,
%U A238708 1241,1411,1595,1807,2039,2303,2593,2923,3283,3691,4139,4643,5195
%N A238708 Number of strict partitions of n that include a pair of consecutive integers.
%C A238708 Column 2 of the array at A238709.
%C A238708 Column k=1 of A238354. - _Alois P. Heinz_, May 02 2014
%H A238708 Alois P. Heinz, <a href="/A238708/b238708.txt">Table of n, a(n) for n = 0..10000</a>
%F A238708 a(n) = A000009(n) - A003114(n). - _George Beck_, Jan 01 2022
%e A238708 a(10) = 4 counts these partitions: 721, 541, 532, 4321.
%t A238708 PartitionsQ[Range[50]] - Table[Count[IntegerPartitions[n], p_ /; Min[p] >= Length[p]], {n, 50}]
%Y A238708 Cf. A238709, A000009, A238354.
%K A238708 nonn,easy
%O A238708 0,8
%A A238708 _Clark Kimberling_, Mar 03 2014