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.

A249632 Triangular array read by rows. T(n,k) is the number of labeled trees with black and white nodes having exactly k black nodes, n>=0, 0<=k<=n.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 3
7 9
8 9
9 3
10 16
11 64
12 96
13 64
14 16
15 125
16 625
17 1250
18 1250
19 625
20 125
21 1296
22 7776
23 19440
24 25920
25 19440
26 7776
27 1296
28 16807
29 117649
30 352947
31 588245
32 588245
33 352947
34 117649
35 16807
36 262144
37 2097152
38 7340032
39 14680064
40 18350080
41 14680064
42 7340032
43 2097152
44 262144

List of values

[1, 1, 1, 1, 2, 1, 3, 9, 9, 3, 16, 64, 96, 64, 16, 125, 625, 1250, 1250, 625, 125, 1296, 7776, 19440, 25920, 19440, 7776, 1296, 16807, 117649, 352947, 588245, 588245, 352947, 117649, 16807, 262144, 2097152, 7340032, 14680064, 18350080, 14680064, 7340032, 2097152, 262144]