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.

A238415 Triangle read by rows: T(n,k) is the number of trees with n vertices having k branching vertices (n>=2, 0<=k<=floor(n/2) - 1).

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 1
7 2
8 1
9 4
10 1
11 1
12 7
13 3
14 1
15 11
16 10
17 1
18 1
19 17
20 24
21 5
22 1
23 25
24 56
25 22
26 2
27 1
28 36
29 114
30 74
31 10
32 1
33 50
34 224
35 219
36 55
37 2
38 1
39 70
40 411
41 576
42 224
43 19
44 1
45 94
46 733
47 1394
48 807
49 126
50 4
51 1
52 127
53 1252
54 3150
55 2536
56 637
57 38
58 1
59 168
60 2091
61 6733
62 7305
63 2711
64 305
65 6

List of values

[1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 7, 3, 1, 11, 10, 1, 1, 17, 24, 5, 1, 25, 56, 22, 2, 1, 36, 114, 74, 10, 1, 50, 224, 219, 55, 2, 1, 70, 411, 576, 224, 19, 1, 94, 733, 1394, 807, 126, 4, 1, 127, 1252, 3150, 2536, 637, 38, 1, 168, 2091, 6733, 7305, 2711, 305, 6]