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.

A227774 Triangular array read by rows: T(n,k) is the number of rooted identity trees with n nodes having exactly k subtrees from the root.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 1
6 2
7 1
8 3
9 3
10 6
11 5
12 1
13 12
14 11
15 2
16 25
17 22
18 5
19 52
20 49
21 12
22 113
23 104
24 28
25 2
26 247
27 232
28 65
29 4
30 548
31 513
32 152
33 13
34 1226
35 1159
36 351
37 34
38 2770
39 2619
40 818
41 91
42 1
43 6299
44 5989
45 1907
46 225
47 6
48 14426
49 13734
50 4460
51 571
52 18
53 33209
54 31729
55 10453
56 1403
57 57
58 76851

List of values

[1, 1, 1, 1, 1, 2, 1, 3, 3, 6, 5, 1, 12, 11, 2, 25, 22, 5, 52, 49, 12, 113, 104, 28, 2, 247, 232, 65, 4, 548, 513, 152, 13, 1226, 1159, 351, 34, 2770, 2619, 818, 91, 1, 6299, 5989, 1907, 225, 6, 14426, 13734, 4460, 571, 18, 33209, 31729, 10453, 1403, 57, 76851]