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.

A143398 Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 3
5 1
6 0
7 10
8 3
9 1
10 0
11 41
12 9
13 4
14 1
15 0
16 196
17 40
18 10
19 5
20 1
21 0
22 1057
23 210
24 30
25 15
26 6
27 1
28 0
29 6322
30 1176
31 175
32 35
33 21
34 7
35 1
36 0
37 41393
38 7273
39 1176
40 105
41 56
42 28
43 8
44 1
45 0
46 293608
47 49932
48 7084
49 756
50 126
51 84
52 36
53 9
54 1
55 0
56 2237921
57 372060
58 42120
59 6510
60 378
61 210
62 120
63 45
64 10
65 1

List of values

[1, 0, 1, 0, 3, 1, 0, 10, 3, 1, 0, 41, 9, 4, 1, 0, 196, 40, 10, 5, 1, 0, 1057, 210, 30, 15, 6, 1, 0, 6322, 1176, 175, 35, 21, 7, 1, 0, 41393, 7273, 1176, 105, 56, 28, 8, 1, 0, 293608, 49932, 7084, 756, 126, 84, 36, 9, 1, 0, 2237921, 372060, 42120, 6510, 378, 210, 120, 45, 10, 1]