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 A243737 #9 Feb 10 2015 04:00:17
%S A243737 1,0,1,3,7,13,25,46,89,175,351,710,1443,2926,5920,11936,23987,48072,
%T A243737 96139,191977,382992,763686,1522581,3035979,6055454,12082887,24120923,
%U A243737 48174935,96259627,192418152,384772810,769651514,1539889604,3081525905,6167365392
%N A243737 Number of compositions of n with exactly two occurrences of the largest part.
%H A243737 Joerg Arndt and Alois P. Heinz, <a href="/A243737/b243737.txt">Table of n, a(n) for n = 2..650</a>
%p A243737 b:= proc(n, p, i) option remember; `if`(n=0, p!,
%p A243737 `if`(i<1, 0, add(b(n-i*j, p+j, i-1)/j!, j=0..n/i)))
%p A243737 end:
%p A243737 a:= proc(n) local k; k:=2;
%p A243737 add(b(n-i*k, k, i-1)/k!, i=1..n/k)
%p A243737 end:
%p A243737 seq(a(n), n=2..40);
%t A243737 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=2; Sum[b[n-i*k, k, i-1]/k!, {i, 1, n/k}]) ; Table[ a[n], {n, 2, 40}] (* _Jean-François Alcover_, Feb 10 2015, after Maple *)
%Y A243737 Column k=2 of A238341.
%K A243737 nonn
%O A243737 2,4
%A A243737 _Joerg Arndt_ and _Alois P. Heinz_, Jun 09 2014