A101486 - cp's OEIS frontend

A101486 Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to -1,0,1, with n nodes that have no label greater than k.

n	a(n)
0	1
1	1
2	2
3	1
4	3
5	9
6	1
7	3
8	17
9	54
10	1
11	3
12	18
13	119
14	378
15	1
16	3
17	18
18	134
19	932
20	2916
21	1
22	3
23	18
24	135
25	1111
26	7838
27	24057
28	1
29	3
30	18
31	135
32	1133
33	9833
34	69275
35	208494
36	1
37	3
38	18
39	135
40	1134
41	10176
42	90959
43	635279
44	1876446
45	1
46	3
47	18
48	135
49	1134
50	10205
51	95635
52	868827
53	5994584
54	222646205

[1, 1, 2, 1, 3, 9, 1, 3, 17, 54, 1, 3, 18, 119, 378, 1, 3, 18, 134, 932, 2916, 1, 3, 18, 135, 1111, 7838, 24057, 1, 3, 18, 135, 1133, 9833, 69275, 208494, 1, 3, 18, 135, 1134, 10176, 90959, 635279, 1876446, 1, 3, 18, 135, 1134, 10205, 95635, 868827, 5994584, 222646205]

cp's OEIS Frontend

A101486 Square array T(n,k), read by antidiagonals: number of labeled trees, with increments of labels along edges constrained to -1,0,1, with n nodes that have no label greater than k.

Table of values

List of values