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.

A319539 Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2.

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 3
6 1
7 4
8 6
9 6
10 2
11 5
12 10
13 18
14 18
15 3
16 6
17 15
18 40
19 75
20 54
21 6
22 7
23 21
24 75
25 215
26 333
27 183
28 11
29 8
30 28
31 126
32 495
33 1260
34 1620
35 636
36 23
37 9
38 36
39 196
40 987
41 3600
42 8010
43 8208
44 2316
45 46
46 10
47 45
48 288
49 1778
50 8568
51 28275
52 53240
53 43188
54 8610
55 98
56 11
57 55
58 405
59 2970
60 17934
61 80136
62 232500
63 366680
64 232947
65 32763
66 207

List of values

[1, 2, 1, 3, 3, 1, 4, 6, 6, 2, 5, 10, 18, 18, 3, 6, 15, 40, 75, 54, 6, 7, 21, 75, 215, 333, 183, 11, 8, 28, 126, 495, 1260, 1620, 636, 23, 9, 36, 196, 987, 3600, 8010, 8208, 2316, 46, 10, 45, 288, 1778, 8568, 28275, 53240, 43188, 8610, 98, 11, 55, 405, 2970, 17934, 80136, 232500, 366680, 232947, 32763, 207]