A102003 - cp's OEIS frontend

A102003 Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of odd length (n>=0, 0<=k<=n).

n	a(n)
0	1
1	0
2	1
3	1
4	0
5	1
6	0
7	3
8	0
9	2
10	2
11	0
12	8
13	0
14	4
15	0
16	11
17	0
18	22
19	0
20	9
21	5
22	0
23	45
24	0
25	61
26	0
27	21
28	0
29	41
30	0
31	166
32	0
33	171
34	0
35	51
36	14
37	0
38	226
39	0
40	580
41	0
42	483
43	0
44	127
45	0
46	154
47	0
48	1050
49	0
50	1962
51	0
52	1373
53	0
54	323
55	42
56	0
57	1070
58	0
59	4430
60	0
61	6496
62	0
63	3923
64	0
65	835
66	0
67	582
68	0
69	6005
70	0
71	17570
72	0
73	21184
74	0
75	11257
76	0
77	2188

[1, 0, 1, 1, 0, 1, 0, 3, 0, 2, 2, 0, 8, 0, 4, 0, 11, 0, 22, 0, 9, 5, 0, 45, 0, 61, 0, 21, 0, 41, 0, 166, 0, 171, 0, 51, 14, 0, 226, 0, 580, 0, 483, 0, 127, 0, 154, 0, 1050, 0, 1962, 0, 1373, 0, 323, 42, 0, 1070, 0, 4430, 0, 6496, 0, 3923, 0, 835, 0, 582, 0, 6005, 0, 17570, 0, 21184, 0, 11257, 0, 2188]

cp's OEIS Frontend

A102003 Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of odd length (n>=0, 0<=k<=n).

Table of values

List of values