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.

A339788 Triangle read by rows: T(n,k) is the number of forests with n unlabeled vertices and maximum vertex degree k, (0 <= k < n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 4, 2, 1, 1, 3, 7, 6, 2, 1, 1, 3, 11, 13, 6, 2, 1, 1, 4, 17, 30, 15, 6, 2, 1, 1, 4, 25, 60, 39, 15, 6, 2, 1, 1, 5, 36, 128, 94, 41, 15, 6, 2, 1, 1, 5, 50, 254, 232, 103, 41, 15, 6, 2, 1, 1, 6, 70, 523, 561, 270, 105, 41, 15, 6, 2, 1]