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.

A138650 Table where T(n,k) is the number of unordered trees with n edges (n+1 nodes) whose node out-degrees form the k-th partition of the integer n (in Mathematica order).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 2
9 1
10 4
11 1
12 1
13 2
14 2
15 4
16 4
17 6
18 1
19 1
20 2
21 2
22 4
23 1
24 8
25 7
26 2
27 11
28 9
29 1
30 1
31 2
32 2
33 4
34 2
35 8
36 7
37 6
38 5
39 21
40 11
41 9
42 24
43 12
44 1

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 4, 1, 1, 2, 2, 4, 4, 6, 1, 1, 2, 2, 4, 1, 8, 7, 2, 11, 9, 1, 1, 2, 2, 4, 2, 8, 7, 6, 5, 21, 11, 9, 24, 12, 1]