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 A244169 #4 Jun 21 2014 16:39:10 %S A244169 1,0,0,0,0,0,1,0,0,0,0,0,925,1716,4719,5005,11011,12376,24494,28848, %T A244169 49771,60985,94997,113323,176576,205948,300841,362000,502840,588343, %U A244169 17972200,47500741,164220317,452654380,1198032651,2936508011,6683727408,15107475055 %N A244169 Number of compositions of n in which the minimal multiplicity of parts equals 6. %H A244169 Alois P. Heinz, <a href="/A244169/b244169.txt">Table of n, a(n) for n = 6..400</a> %p A244169 b:= proc(n, i, p, k) option remember; `if`(n=0, p!, `if`(i<1, 0, %p A244169 add(b(n-i*j, i-1, p+j, k)/j!, j=[0, $max(1, k)..n/i]))) %p A244169 end: %p A244169 a:= n-> b(n$2, 0, 6) -b(n$2, 0, 7): %p A244169 seq(a(n), n=6..50); %Y A244169 Column k=6 of A242451. %K A244169 nonn %O A244169 6,13 %A A244169 _Alois P. Heinz_, Jun 21 2014