A101489 - cp's OEIS frontend

A101489 Square array T(n,k), read by antidiagonals: number of binary trees, with n nodes that have no label greater than k.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	2
9	2
10	1
11	1
12	2
13	4
14	4
15	1
16	1
17	2
18	5
19	10
20	10
21	1
22	1
23	2
24	5
25	13
26	26
27	26
28	1
29	1
30	2
31	5
32	14
33	37
34	73
35	73
36	1
37	1
38	2
39	5
40	14
41	41
42	109
43	213
44	213
45	1
46	1
47	2
48	5
49	14
50	42
51	126
52	334
53	645
54	645
55	1
56	1
57	2
58	5
59	14
60	42
61	131
62	398
63	1050
64	2007
65	2007
66	1
67	1
68	2
69	5
70	14
71	42
72	132
73	422
74	1289
75	3377
76	6391
77	6391

[1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 4, 4, 1, 1, 2, 5, 10, 10, 1, 1, 2, 5, 13, 26, 26, 1, 1, 2, 5, 14, 37, 73, 73, 1, 1, 2, 5, 14, 41, 109, 213, 213, 1, 1, 2, 5, 14, 42, 126, 334, 645, 645, 1, 1, 2, 5, 14, 42, 131, 398, 1050, 2007, 2007, 1, 1, 2, 5, 14, 42, 132, 422, 1289, 3377, 6391, 6391]

cp's OEIS Frontend

A101489 Square array T(n,k), read by antidiagonals: number of binary trees, with n nodes that have no label greater than k.

Table of values

List of values