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.

A291204 Number F(n,h,t) of forests of t labeled rooted trees with n vertices such that the root of each subtree contains the subtree's minimal label and h is the maximum of 0 and the tree heights; triangle of triangles F(n,h,t), n>=0, h=0..n, t=0..n-h, read by layers, then by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 0
5 0
6 1
7 0
8 1
9 0
10 0
11 0
12 0
13 1
14 0
15 1
16 3
17 0
18 1
19 0
20 0
21 0
22 0
23 0
24 1
25 0
26 1
27 7
28 6
29 0
30 4
31 4
32 0
33 1
34 0
35 0
36 0
37 0
38 0
39 0
40 1
41 0
42 1
43 15
44 25
45 10
46 0
47 14
48 30
49 10
50 0
51 8
52 5
53 0
54 1
55 0
56 0
57 0
58 0
59 0
60 0
61 0
62 1
63 0
64 1
65 31
66 90
67 65
68 15
69 0
70 51
71 174
72 120
73 20
74 0
75 54
76 63
77 15
78 0
79 13
80 6
81 0
82 1
83 0

List of values

[1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 3, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 7, 6, 0, 4, 4, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 15, 25, 10, 0, 14, 30, 10, 0, 8, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 31, 90, 65, 15, 0, 51, 174, 120, 20, 0, 54, 63, 15, 0, 13, 6, 0, 1, 0]