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.

A073346 Table T(n,k) (listed antidiagonalwise in order T(0,0), T(1,0), T(0,1), T(2,0), T(1,1), ...) giving the number of rooted plane binary trees of size n and "contracted height" k.

Table of values

n a(n)
0 1
1 1
2 0
3 0
4 0
5 0
6 1
7 2
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 2
17 4
18 0
19 0
20 0
21 0
22 2
23 4
24 0
25 0
26 0
27 0
28 1
29 0
30 8
31 8
32 0
33 0
34 0
35 0
36 0
37 0
38 12
39 16
40 0
41 0
42 0
43 0
44 0
45 0
46 2
47 12
48 40
49 16
50 0
51 0
52 0
53 0
54 0
55 0
56 2
57 12
58 80
59 48
60 0
61 0
62 0
63 0
64 0
65 0
66 0
67 0
68 12
69 136
70 144
71 32
72 0
73 0
74 0
75 0
76 0
77 0
78 0
79 2
80 20
81 224
82 384
83 128
84 0
85 0
86 0
87 0
88 0
89 0
90 0
91 0
92 0
93 16

List of values

[1, 1, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 4, 0, 0, 0, 0, 2, 4, 0, 0, 0, 0, 1, 0, 8, 8, 0, 0, 0, 0, 0, 0, 12, 16, 0, 0, 0, 0, 0, 0, 2, 12, 40, 16, 0, 0, 0, 0, 0, 0, 2, 12, 80, 48, 0, 0, 0, 0, 0, 0, 0, 0, 12, 136, 144, 32, 0, 0, 0, 0, 0, 0, 0, 2, 20, 224, 384, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16]