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 A243743 #7 Feb 10 2015 04:01:00
%S A243743 1,0,0,0,0,0,0,0,1,9,45,165,495,1287,3003,6435,12871,24319,43812,
%T A243743 75837,127005,207252,332343,529617,851797,1410484,2456794,4572624,
%U A243743 9116790,19248417,42237738,94608183,213426424,480788350,1076330078,2388681769,5249788389
%N A243743 Number of compositions of n with exactly eight occurrences of the largest part.
%H A243743 Joerg Arndt and Alois P. Heinz, <a href="/A243743/b243743.txt">Table of n, a(n) for n = 8..650</a>
%p A243743 b:= proc(n, p, i) option remember; `if`(n=0, p!,
%p A243743 `if`(i<1, 0, add(b(n-i*j, p+j, i-1)/j!, j=0..n/i)))
%p A243743 end:
%p A243743 a:= proc(n) local k; k:=8;
%p A243743 add(b(n-i*k, k, i-1)/k!, i=1..n/k)
%p A243743 end:
%p A243743 seq(a(n), n=8..50);
%t A243743 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=8; Sum[b[n-i*k, k, i-1]/k!, {i, 1, n/k}]); Table[a[n], {n, 8, 50}] (* _Jean-François Alcover_, Feb 10 2015, after Maple *)
%Y A243743 Column k=8 of A238341.
%K A243743 nonn
%O A243743 8,10
%A A243743 _Joerg Arndt_ and _Alois P. Heinz_, Jun 09 2014