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.

A227341 Triangular array: Number of partitions of the vertex set of a forest of two trees on n vertices into k nonempty independent sets.

Table of values

n a(n)
1 1
2 1
3 1
4 0
5 2
6 1
7 0
8 2
9 4
10 1
11 0
12 2
13 10
14 7
15 1
16 0
17 2
18 22
19 31
20 11
21 1
22 0
23 2
24 46
25 115
26 75
27 16
28 1
29 0
30 2
31 94
32 391
33 415
34 155
35 22
36 1
37 0
38 2
39 190
40 1267
41 2051
42 1190
43 287
44 29
45 1
46 0
47 2
48 382
49 3991
50 9471
51 8001
52 2912
53 490
54 37
55 1
56 0
57 2
58 766
59 12355
60 41875
61 49476
62 25473
63 6342
64 786
65 46
66 1

List of values

[1, 1, 1, 0, 2, 1, 0, 2, 4, 1, 0, 2, 10, 7, 1, 0, 2, 22, 31, 11, 1, 0, 2, 46, 115, 75, 16, 1, 0, 2, 94, 391, 415, 155, 22, 1, 0, 2, 190, 1267, 2051, 1190, 287, 29, 1, 0, 2, 382, 3991, 9471, 8001, 2912, 490, 37, 1, 0, 2, 766, 12355, 41875, 49476, 25473, 6342, 786, 46, 1]