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.

A238414 Triangle read by rows: T(n,k) is the number of trees with n vertices having maximum vertex degree k (n>=1, 0<=k<=n-1).

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 0
6 1
7 0
8 0
9 1
10 1
11 0
12 0
13 1
14 1
15 1
16 0
17 0
18 1
19 3
20 1
21 1
22 0
23 0
24 1
25 5
26 3
27 1
28 1
29 0
30 0
31 1
32 10
33 7
34 3
35 1
36 1
37 0
38 0
39 1
40 17
41 17
42 7
43 3
44 1
45 1
46 0
47 0
48 1
49 36
50 38
51 19
52 7
53 3
54 1
55 1
56 0
57 0
58 1
59 65
60 93
61 45
62 19
63 7
64 3
65 1
66 1
67 0
68 0
69 1
70 134
71 220
72 118
73 47
74 19
75 7
76 3
77 1
78 1
79 0
80 0
81 1
82 264
83 537
84 296
85 125
86 47
87 19
88 7
89 3
90 1
91 1

List of values

[1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 3, 1, 1, 0, 0, 1, 5, 3, 1, 1, 0, 0, 1, 10, 7, 3, 1, 1, 0, 0, 1, 17, 17, 7, 3, 1, 1, 0, 0, 1, 36, 38, 19, 7, 3, 1, 1, 0, 0, 1, 65, 93, 45, 19, 7, 3, 1, 1, 0, 0, 1, 134, 220, 118, 47, 19, 7, 3, 1, 1, 0, 0, 1, 264, 537, 296, 125, 47, 19, 7, 3, 1, 1]