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 A218568 #11 Jul 19 2017 20:18:27
%S A218568 1,1,3,3,7,8,14,17,26,31,45,54,73,87,114,135,171,200,249,290,352,406,
%T A218568 487,560,660,752,879,997,1153,1298,1489,1671,1900,2121,2397,2665,2992,
%U A218568 3311,3701,4081,4535,4982,5514,6042,6655,7265,7977,8686,9502,10314,11248
%N A218568 Number of partitions p of n such that max(p)-min(p) = 5.
%H A218568 Alois P. Heinz, <a href="/A218568/b218568.txt">Table of n, a(n) for n = 7..1000</a>
%H A218568 G. E. Andrews, M. Beck and N. Robbins, <a href="https://arxiv.org/abs/1406.3374">Partitions with fixed differences between largest and smallest parts</a>, arXiv:1406.3374 [math.NT], 2014
%F A218568 G.f.: Sum_{k>0} x^(2*k+5)/Product_{j=0..5} (1-x^(k+j)).
%F A218568 a(n) = A097364(n,5) = A116685(n,5) = A194621(n,5) - A194621(n,4) = A218507(n) - A218506(n).
%t A218568 Table[Count[IntegerPartitions[n],_?(Max[#]-Min[#]==5&)],{n,7,60}] (* _Harvey P. Dale_, Sep 25 2015 *)
%K A218568 nonn
%O A218568 7,3
%A A218568 _Alois P. Heinz_, Nov 02 2012