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 A243738 #7 Feb 10 2015 04:00:24
%S A243738 1,0,0,1,4,10,21,39,70,125,229,435,859,1739,3574,7384,15239,31312,
%T A243738 63968,129898,262316,527169,1055254,2105849,4192933,8335832,16557580,
%U A243738 32877010,65286137,129695835,257817166,512918318,1021351641,2035674817,4061093104,8108844651
%N A243738 Number of compositions of n with exactly three occurrences of the largest part.
%H A243738 Joerg Arndt and Alois P. Heinz, <a href="/A243738/b243738.txt">Table of n, a(n) for n = 3..650</a>
%p A243738 b:= proc(n, p, i) option remember; `if`(n=0, p!,
%p A243738 `if`(i<1, 0, add(b(n-i*j, p+j, i-1)/j!, j=0..n/i)))
%p A243738 end:
%p A243738 a:= proc(n) local k; k:=3;
%p A243738 add(b(n-i*k, k, i-1)/k!, i=1..n/k)
%p A243738 end:
%p A243738 seq(a(n), n=3..40);
%t A243738 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=3; Sum[b[n-i*k, k, i-1]/k!, {i, 1, n/k}]); Table[a[n], {n, 3, 40}] (* _Jean-François Alcover_, Feb 10 2015, after Maple *)
%Y A243738 Column k=3 of A238341.
%K A243738 nonn
%O A243738 3,5
%A A243738 _Joerg Arndt_ and _Alois P. Heinz_, Jun 09 2014