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 A055826 #11 Jan 23 2020 12:33:06 %S A055826 1,11,60,328,1800,9924,54964,305680,1706256,9554620,53653996, %T A055826 302038488,1703995800,9631951476,54539233380,309296779296, %U A055826 1756495236128,9987721546860,56857004161180,324008331785320,1848182861702184 %N A055826 a(n) = T(2n+2,n), array T as in A055818. %H A055826 G. C. Greubel, <a href="/A055826/b055826.txt">Table of n, a(n) for n = 0..250</a> %p A055826 T:= proc(i, j) option remember; %p A055826 if i=0 or j=0 then 1 %p A055826 else add(add(T(h,m), m=0..j), h=0..i-1) %p A055826 fi; end: %p A055826 seq(T(n+2, n), n=0..30); # _G. C. Greubel_, Jan 22 2020 %t A055826 T[i_, j_]:= T[i, j]= If[i==0 || j==0, 1, Sum[T[h, m], {h,0,i-1}, {m,0,j}]]; Table[T[n+2, n], {n,0,25}] (* _G. C. Greubel_, Jan 22 2020 *) %o A055826 (Sage) %o A055826 @CachedFunction %o A055826 def T(i, j): %o A055826 if (i==0 or j==0): return 1 %o A055826 else: return sum(sum(T(h,m) for m in (0..j)) for h in (0..i-1)) %o A055826 [T(n+2, n) for n in (0..30)] # _G. C. Greubel_, Jan 22 2020 %Y A055826 Cf. A055818, A055819, A055820, A055821, A055822, A055823, A055824, A055825, A055827, A055828, A055829. %K A055826 nonn %O A055826 0,2 %A A055826 _Clark Kimberling_, May 28 2000