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.

A143397 Triangle T(n,k)=number of forests of labeled rooted trees of height at most 1, with n labels and k nodes, where any root may contain >= 1 labels, n >= 0, 0<=k<=n.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 3
6 0
7 1
8 6
9 10
10 0
11 1
12 11
13 36
14 41
15 0
16 1
17 20
18 105
19 230
20 196
21 0
22 1
23 37
24 285
25 955
26 1560
27 1057
28 0
29 1
30 70
31 756
32 3535
33 8680
34 11277
35 6322
36 0
37 1
38 135
39 2002
40 12453
41 41720
42 80682
43 86800
44 41393
45 0
46 1
47 264
48 5347
49 43008
50 186669
51 485982
52 773724
53 708948
54 293608

List of values

[1, 0, 1, 0, 1, 3, 0, 1, 6, 10, 0, 1, 11, 36, 41, 0, 1, 20, 105, 230, 196, 0, 1, 37, 285, 955, 1560, 1057, 0, 1, 70, 756, 3535, 8680, 11277, 6322, 0, 1, 135, 2002, 12453, 41720, 80682, 86800, 41393, 0, 1, 264, 5347, 43008, 186669, 485982, 773724, 708948, 293608]