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 A243739 #7 Feb 10 2015 04:00:35
%S A243739 1,0,0,0,1,5,15,35,71,131,230,395,686,1231,2316,4565,9326,19466,41002,
%T A243739 86401,181231,377441,779797,1598263,3251522,6571171,13204057,26404654,
%U A243739 52595856,104445292,206934917,409352089,809015298,1598295894,3157969548,6242861979
%N A243739 Number of compositions of n with exactly four occurrences of the largest part.
%H A243739 Joerg Arndt and Alois P. Heinz, <a href="/A243739/b243739.txt">Table of n, a(n) for n = 4..650</a>
%p A243739 b:= proc(n, p, i) option remember; `if`(n=0, p!,
%p A243739 `if`(i<1, 0, add(b(n-i*j, p+j, i-1)/j!, j=0..n/i)))
%p A243739 end:
%p A243739 a:= proc(n) local k; k:=4;
%p A243739 add(b(n-i*k, k, i-1)/k!, i=1..n/k)
%p A243739 end:
%p A243739 seq(a(n), n=4..40);
%t A243739 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=4; Sum[b[n-i*k, k, i-1]/k!, {i, 1, n/k}]); Table[a[n], {n, 4, 40}] (* _Jean-François Alcover_, Feb 10 2015, after Maple *)
%Y A243739 Column k=4 of A238341.
%K A243739 nonn
%O A243739 4,6
%A A243739 _Joerg Arndt_ and _Alois P. Heinz_, Jun 09 2014