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 A243745 #7 Feb 10 2015 04:01:12
%S A243745 1,0,0,0,0,0,0,0,0,0,1,11,66,286,1001,3003,8008,19448,43758,92378,
%T A243745 184757,352727,646723,1144484,1963181,3276625,5341050,8537815,
%U A243745 13454155,21056035,33090201,53057236,88592087,157261599,300524147,616878471,1339454952,3015109174
%N A243745 Number of compositions of n with exactly ten occurrences of the largest part.
%H A243745 Joerg Arndt and Alois P. Heinz, <a href="/A243745/b243745.txt">Table of n, a(n) for n = 10..650</a>
%p A243745 b:= proc(n, p, i) option remember; `if`(n=0, p!,
%p A243745 `if`(i<1, 0, add(b(n-i*j, p+j, i-1)/j!, j=0..n/i)))
%p A243745 end:
%p A243745 a:= proc(n) local k; k:=10;
%p A243745 add(b(n-i*k, k, i-1)/k!, i=1..n/k)
%p A243745 end:
%p A243745 seq(a(n), n=10..50);
%t A243745 b[n_, p_, i_] := b[n, p, i] = If[n == 0, p!, If[i<1, 0, Sum[b[n-i*j, p+j, i-1]/j!, {j, 0, n/i}]]]; a[n_] := (k=10; Sum[b[n-i*k, k, i-1]/k!, {i, 1, n/k}]); Table[ a[n], {n, 10, 50}] (* _Jean-François Alcover_, Feb 10 2015, after Maple *)
%Y A243745 Column k=10 of A238341.
%K A243745 nonn
%O A243745 10,12
%A A243745 _Joerg Arndt_ and _Alois P. Heinz_, Jun 09 2014