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.

A360985 Triangle read by rows: T(n,k) is the number of full binary trees with n leaves, each internal node having the heights of its two subtrees weakly increasing left to right, and with k internal nodes having two subtrees of equal height.

Table of values

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

List of values

[1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 2, 2, 1, 0, 0, 1, 4, 3, 2, 2, 0, 0, 1, 6, 7, 6, 3, 0, 1, 0, 1, 9, 13, 14, 9, 3, 1, 0, 0, 1, 12, 27, 27, 22, 14, 3, 1, 0, 0, 1, 16, 47, 59, 54, 32, 16, 7, 0, 0, 0, 1, 20, 81, 117, 125, 91, 44, 20, 8, 1, 0]