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.

A336096 Irregular triangular array read by rows. T(n,k) is the number of unlabeled forests of distinct trees on n nodes containing exactly k trees.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 3
8 3
9 6
10 5
11 1
12 11
13 11
14 2
15 23
16 21
17 5
18 47
19 46
20 12
21 106
22 96
23 27
24 2
25 235
26 216
27 62
28 4
29 551
30 482
31 142
32 13
33 1301
34 1121
35 328
36 33
37 3159
38 2633
39 763
40 87
41 1
42 7741
43 6334
44 1809
45 211
46 6
47 19320
48 15414
49 4322
50 532
51 18
52 48629
53 38132
54 10488
55 1301
56 55
57 123867
58 95321
59 25710
60 3232
61 157
62 317955
63 241029
64 63802
65 7996
66 429
67 3
68 823065
69 614862
70 159817
71 19973
72 1149
73 12

List of values

[1, 1, 1, 1, 2, 1, 3, 3, 6, 5, 1, 11, 11, 2, 23, 21, 5, 47, 46, 12, 106, 96, 27, 2, 235, 216, 62, 4, 551, 482, 142, 13, 1301, 1121, 328, 33, 3159, 2633, 763, 87, 1, 7741, 6334, 1809, 211, 6, 19320, 15414, 4322, 532, 18, 48629, 38132, 10488, 1301, 55, 123867, 95321, 25710, 3232, 157, 317955, 241029, 63802, 7996, 429, 3, 823065, 614862, 159817, 19973, 1149, 12]