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.

A214571 Irregular triangle read by rows: T(n,k) is the number of ordered 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 2
6 5
7 6
8 3
9 6
10 16
11 12
12 8
13 10
14 34
15 21
16 32
17 5
18 30
19 11
20 68
21 48
22 100
23 15
24 108
25 0
26 24
27 9
28 10
29 0
30 36
31 16
32 126
33 81
34 260
35 30
36 336
37 7
38 128
39 45
40 40
41 0
42 264
43 0
44 0
45 15
46 0
47 0
48 18
49 0
50 40
51 0
52 0
53 0
54 24
55 19
56 222
57 141
58 616
59 60
60 828
61 21
62 520
63 117
64 130
65 0
66 1140
67 0
68 0
69 45
70 80
71 0
72 234
73 0
74 160
75 21
76 0
77 0
78 312
79 0
80 0
81 0
82 0
83 0
84 120
85 0
86 0
87 0
88 0
89 0
90 36
91 0
92 0
93 0
94 40
95 26
96 372
97 219
98 1392
99 90
100 1914
101 42
102 1664
103 315
104 320
105 0
106 3696
107 0
108 28
109 195
110 544
111 0
112 1044
113 0
114 580
115 21
116 0
117 0
118 2112
119 0
120 0
121 27
122 28
123 0
124 480
125 0
126 0
127 0
128 0
129 35
130 648
131 0
132 0
133 0
134 320
135 0
136 84
137 0
138 0
139 0
140 0
141 0
142 240
143 0
144 0
145 0
146 0
147 0
148 0
149 0
150 0
151 0
152 0
153 0
154 360

List of values

[1, 1, 2, 3, 2, 5, 6, 3, 6, 16, 12, 8, 10, 34, 21, 32, 5, 30, 11, 68, 48, 100, 15, 108, 0, 24, 9, 10, 0, 36, 16, 126, 81, 260, 30, 336, 7, 128, 45, 40, 0, 264, 0, 0, 15, 0, 0, 18, 0, 40, 0, 0, 0, 24, 19, 222, 141, 616, 60, 828, 21, 520, 117, 130, 0, 1140, 0, 0, 45, 80, 0, 234, 0, 160, 21, 0, 0, 312, 0, 0, 0, 0, 0, 120, 0, 0, 0, 0, 0, 36, 0, 0, 0, 40, 26, 372, 219, 1392, 90, 1914, 42, 1664, 315, 320, 0, 3696, 0, 28, 195, 544, 0, 1044, 0, 580, 21, 0, 0, 2112, 0, 0, 27, 28, 0, 480, 0, 0, 0, 0, 35, 648, 0, 0, 0, 320, 0, 84, 0, 0, 0, 0, 0, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 360]