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 A218569 #10 Jul 19 2017 20:19:07
%S A218569 1,1,3,3,7,8,14,18,27,33,49,59,81,100,131,158,205,243,306,365,448,527,
%T A218569 642,748,896,1042,1231,1418,1667,1906,2215,2527,2909,3298,3781,4260,
%U A218569 4847,5446,6158,6886,7756,8633,9669,10738,11970,13239,14713,16212,17943
%N A218569 Number of partitions p of n such that max(p)-min(p) = 6.
%H A218569 Alois P. Heinz, <a href="/A218569/b218569.txt">Table of n, a(n) for n = 8..1000</a>
%H A218569 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 A218569 G.f.: Sum_{k>0} x^(2*k+6)/Product_{j=0..6} (1-x^(k+j)).
%F A218569 a(n) = A097364(n,6) = A116685(n,6) = A194621(n,6) - A194621(n,5) = A218508(n) - A218507(n).
%t A218569 Table[Count[IntegerPartitions[n],_?(First[#]-Last[#]==6&)],{n,8,60}] (* _Harvey P. Dale_, Feb 09 2015 *)
%K A218569 nonn
%O A218569 8,3
%A A218569 _Alois P. Heinz_, Nov 02 2012