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.

A174135 Irregular triangle read by rows: T(n,k), n >= 2, 1 <= k <= n/2, = number of rooted forests with n nodes and k trees, with at least two nodes in each tree.

Table of values

n a(n)
2 1
3 2
4 4
5 1
6 9
7 2
8 20
9 7
10 1
11 48
12 17
13 2
14 115
15 48
16 7
17 1
18 286
19 124
20 21
21 2
22 719
23 336
24 60
25 7
26 1
27 1842
28 888
29 171
30 21
31 2
32 4766
33 2393
34 488
35 65
36 7
37 1
38 12486
39 6419
40 1372
41 187
42 21
43 2
44 32973
45 17376
46 3862
47 554
48 65
49 7
50 1
51 87811
52 47097
53 10846
54 1600
55 193
56 21
57 2
58 235381
59 128365
60 30429
61 4644
62 574
63 65
64 7
65 1
66 634847
67 350837
68 85365
69 13362
70 1685
71 193
72 21
73 2

List of values

[1, 2, 4, 1, 9, 2, 20, 7, 1, 48, 17, 2, 115, 48, 7, 1, 286, 124, 21, 2, 719, 336, 60, 7, 1, 1842, 888, 171, 21, 2, 4766, 2393, 488, 65, 7, 1, 12486, 6419, 1372, 187, 21, 2, 32973, 17376, 3862, 554, 65, 7, 1, 87811, 47097, 10846, 1600, 193, 21, 2, 235381, 128365, 30429, 4644, 574, 65, 7, 1, 634847, 350837, 85365, 13362, 1685, 193, 21, 2]