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.

A352460 Triangle read by rows: T(n,k), 2 <= k < n is the number of n-element k-ary unlabeled rooted trees where a subtree consisting of h + 1 nodes has exactly min{h,k} subtrees.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 4, 3, 2, 1, 1, 5, 4, 3, 2, 1, 1, 9, 6, 5, 3, 2, 1, 1, 13, 10, 6, 5, 3, 2, 1, 1, 23, 15, 10, 7, 5, 3, 2, 1, 1, 35, 24, 14, 10, 7, 5, 3, 2, 1, 1, 61, 39, 23, 14, 11, 7, 5, 3, 2, 1, 1, 98, 63, 34, 21, 14, 11, 7, 5, 3, 2, 1, 1]