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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 4
6 3
7 2
8 14
9 27
10 15
11 3
12 48
13 180
14 240
15 105
16 6
17 171
18 1089
19 2604
20 2625
21 945
22 11
23 614
24 6333
25 24180
26 42075
27 34020
28 10395
29 23
30 2270
31 36309
32 207732
33 554820
34 755370
35 509355
36 135135
37 46
38 8518
39 207255
40 1710108
41 6578550
42 13408740
43 14963130
44 8648640
45 2027025

List of values

[1, 1, 1, 1, 4, 3, 2, 14, 27, 15, 3, 48, 180, 240, 105, 6, 171, 1089, 2604, 2625, 945, 11, 614, 6333, 24180, 42075, 34020, 10395, 23, 2270, 36309, 207732, 554820, 755370, 509355, 135135, 46, 8518, 207255, 1710108, 6578550, 13408740, 14963130, 8648640, 2027025]