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.

A214569 Irregular triangle read by rows: T(n,k) is the number of rooted trees having n vertices and isomorphic (as rooted trees) to k ordered trees (n>=1, k>=1).

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 1
6 5
7 3
8 1
9 6
10 8
11 4
12 2
13 10
14 17
15 7
16 8
17 1
18 5
19 11
20 34
21 16
22 25
23 3
24 18
25 0
26 3
27 1
28 1
29 0
30 3
31 16
32 63
33 27
34 65
35 6
36 56
37 1
38 16
39 5
40 4
41 0
42 22
43 0
44 0
45 1
46 0
47 0
48 1
49 0
50 2
51 0
52 0
53 0
54 1
55 19
56 111
57 47
58 154
59 12
60 138
61 3
62 65
63 13
64 13
65 0
66 95
67 0
68 0
69 3
70 5
71 0
72 13
73 0
74 8
75 1
76 0
77 0
78 13
79 0
80 0
81 0
82 0
83 0
84 4
85 0
86 0
87 0
88 0
89 0
90 1
91 0
92 0
93 0
94 1
95 26
96 186
97 73
98 348
99 18
100 319
101 6
102 208
103 35
104 32
105 0
106 308
107 0
108 2
109 13
110 34
111 0
112 58
113 0
114 29
115 1
116 0
117 0
118 88
119 0
120 0
121 1
122 1
123 0
124 16
125 0
126 0
127 0
128 0
129 1
130 18
131 0
132 0
133 0
134 8
135 0
136 2
137 0
138 0
139 0
140 0
141 0
142 5
143 0
144 0
145 0
146 0
147 0
148 0
149 0
150 0
151 0
152 0
153 0
154 6

List of values

[1, 1, 2, 3, 1, 5, 3, 1, 6, 8, 4, 2, 10, 17, 7, 8, 1, 5, 11, 34, 16, 25, 3, 18, 0, 3, 1, 1, 0, 3, 16, 63, 27, 65, 6, 56, 1, 16, 5, 4, 0, 22, 0, 0, 1, 0, 0, 1, 0, 2, 0, 0, 0, 1, 19, 111, 47, 154, 12, 138, 3, 65, 13, 13, 0, 95, 0, 0, 3, 5, 0, 13, 0, 8, 1, 0, 0, 13, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 26, 186, 73, 348, 18, 319, 6, 208, 35, 32, 0, 308, 0, 2, 13, 34, 0, 58, 0, 29, 1, 0, 0, 88, 0, 0, 1, 1, 0, 16, 0, 0, 0, 0, 1, 18, 0, 0, 0, 8, 0, 2, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6]