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 A065329 #17 Aug 30 2023 07:29:23
%S A065329 1,0,2,0,1,8,0,0,8,80,0,0,4,144,4160,0,0,1,168,13888,5632640,0,0,0,
%T A065329 138,31776,36109952,5163215782400,0,0,0,80,54792,158572864,
%U A065329 64827181969920,2169236189050838782284800,0,0,0,32,74624,531441232,552146121580800
%N A065329 Square array read by antidiagonals giving number of binary trees of height n with k points on the n-th level (n,k>0).
%H A065329 H. Bottomley, <a href="/A001699/a001699.gif">Illustration of initial terms</a>
%F A065329 T(n,k) = Sum_{2j >= k} (C(2j,k)*T(n-1,j)) starting with T(1,1) = 1 and T(1,k) = 0 if k>1.
%e A065329 Square array starts:
%e A065329 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
%e A065329 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, ...
%e A065329 8, 8, 4, 1, 0, 0, 0, 0, 0, 0, ...
%e A065329 80, 144, 168, 138, 80, 32, 8, 1, 0, 0, ...
%e A065329 ...
%Y A065329 Row sums are A001699.
%Y A065329 Cf. A073345, A073429.
%K A065329 nonn,tabl
%O A065329 1,3
%A A065329 _Henry Bottomley_, Oct 29 2001
%E A065329 More terms from _Sean A. Irvine_, Aug 30 2023