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.

A138157 Triangle read by rows: T(n,k) is the number of binary trees with n edges and path length k; 0<=k<=n*(n+1)/2.

Table of values

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

List of values

[1, 0, 2, 0, 0, 1, 4, 0, 0, 0, 0, 4, 2, 8, 0, 0, 0, 0, 0, 0, 6, 8, 8, 4, 16, 0, 0, 0, 0, 0, 0, 0, 0, 4, 24, 4, 28, 16, 16, 8, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 24, 36, 48, 24, 56, 40, 56, 32, 32, 16, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 60, 72, 144, 26, 168, 104, 128, 64, 176, 80, 112]