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 A289478 #10 Jul 14 2017 08:48:38
%S A289478 1,1,32767,2962826465,302279227822132,28940151142665744800,
%T A289478 2518778621914294827210397,200931623862007000173683722721,
%U A289478 14934414860406931133627906259665137,1050339437420146526008731445371770861951,70783666464470090848536562606347425026054174
%N A289478 Number of Dyck paths of semilength 8*n and height n.
%H A289478 Alois P. Heinz, <a href="/A289478/b289478.txt">Table of n, a(n) for n = 0..210</a>
%F A289478 a(n) ~ 2^(64*n + 9/2) / (3^(18*n + 7) * 7^(7*n + 1/2) * sqrt(Pi*n)). - _Vaclav Kotesovec_, Jul 14 2017
%p A289478 b:= proc(x, y, k) option remember;
%p A289478 `if`(x=0, 1, `if`(y>0, b(x-1, y-1, k), 0)+
%p A289478 `if`(y < min(x-1, k), b(x-1, y+1, k), 0))
%p A289478 end:
%p A289478 a:= n-> `if`(n=0, 1, b(16*n, 0, n)-b(16*n, 0, n-1)):
%p A289478 seq(a(n), n=0..20);
%t A289478 b[x_, y_, k_]:=b[x, y, k]=If[x==0, 1, If[y>0, b[x - 1, y - 1, k], 0] + If[y<Min[x - 1, k], b[x - 1, y + 1, k], 0]]; a[n_]:=a[n]=If[n==0, 1, b[16n, 0, n] - b[16n, 0, n - 1]]; Table[a[n], {n, 0, 20}] (* _Indranil Ghosh_, Jul 07 2017, after Maple code *)
%Y A289478 Column k=8 of A289481.
%K A289478 nonn
%O A289478 0,3
%A A289478 _Alois P. Heinz_, Jul 06 2017