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.

A335833 Triangle read by rows. T(n,k) is the number of full binary trees with n leaves and with k internal nodes whose left and right children have the same number of leaf descendants, where n > 0 and 0 <= k < n.

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 3
27 0
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 14
41 13
42 8
43 1
44 1
45 0
46 0
47 1
48 12
49 27
50 28
51 23
52 8
53 3
54 1
55 0
56 0
57 1
58 16
59 49
60 58
61 54
62 25
63 8
64 3
65 0
66 0
67 0
68 1
69 20
70 82
71 119
72 125
73 82
74 34
75 15
76 2
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, 3, 0, 0, 0, 1, 6, 7, 6, 3, 0, 1, 0, 1, 9, 14, 13, 8, 1, 1, 0, 0, 1, 12, 27, 28, 23, 8, 3, 1, 0, 0, 1, 16, 49, 58, 54, 25, 8, 3, 0, 0, 0, 1, 20, 82, 119, 125, 82, 34, 15, 2, 1, 0]