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.

A228601 Triangle read by rows: T(n,k) is the number of trees with n vertices and having k distinct rootings (1 <= k <= n).

Table of values

n a(n)
1 1
2 1
3 0
4 0
5 1
6 0
7 0
8 2
9 0
10 0
11 0
12 1
13 1
14 1
15 0
16 0
17 2
18 1
19 2
20 1
21 0
22 0
23 1
24 2
25 4
26 1
27 2
28 1
29 0
30 2
31 1
32 7
33 4
34 4
35 4
36 1
37 0
38 1
39 2
40 7
41 7
42 9
43 10
44 8
45 3
46 0
47 2
48 3
49 12
50 10
51 17
52 19
53 20
54 17
55 6
56 0
57 1
58 2
59 12
60 14
61 28
62 37
63 45
64 46
65 35
66 15
67 0
68 2
69 1
70 18
71 21
72 46
73 60
74 87
75 106
76 103
77 78
78 29

List of values

[1, 1, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 1, 1, 0, 0, 2, 1, 2, 1, 0, 0, 1, 2, 4, 1, 2, 1, 0, 2, 1, 7, 4, 4, 4, 1, 0, 1, 2, 7, 7, 9, 10, 8, 3, 0, 2, 3, 12, 10, 17, 19, 20, 17, 6, 0, 1, 2, 12, 14, 28, 37, 45, 46, 35, 15, 0, 2, 1, 18, 21, 46, 60, 87, 106, 103, 78, 29]