cp's OEIS Frontend

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.

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).

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 1
6 8
7 0
8 0
9 8
10 80
11 0
12 0
13 4
14 144
15 4160
16 0
17 0
18 1
19 168
20 13888
21 5632640
22 0
23 0
24 0
25 138
26 31776
27 36109952
28 5163215782400
29 0
30 0
31 0
32 80
33 54792
34 158572864
35 64827181969920
36 2169236189050838782284800
37 0
38 0
39 0
40 32
41 74624
42 531441232
43 552146121580800

List of values

[1, 0, 2, 0, 1, 8, 0, 0, 8, 80, 0, 0, 4, 144, 4160, 0, 0, 1, 168, 13888, 5632640, 0, 0, 0, 138, 31776, 36109952, 5163215782400, 0, 0, 0, 80, 54792, 158572864, 64827181969920, 2169236189050838782284800, 0, 0, 0, 32, 74624, 531441232, 552146121580800]