A192020 - cp's OEIS frontend

A192020 Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the binomial tree of order n (1 <= k <= 2n-1; entries in row n are the coefficients of the corresponding Wiener polynomial).

n	a(n)
0	1
1	3
2	2
3	1
4	7
5	8
6	8
7	4
8	1
9	15
10	22
11	31
12	28
13	17
14	6
15	1
16	31
17	52
18	90
19	112
20	104
21	68
22	30
23	8
24	1
25	63
26	114
27	225
28	344
29	418
30	388
31	270
32	136
33	47
34	10
35	1
36	127
37	240
38	516
39	908
40	1331
41	1568
42	1464
43	1064
44	589
45	240
46	68
47	12
48	1
49	255
50	494
51	1123
52	2180
53	3663
54	5138
55	5931
56	5560
57	4181
58	2482
59	1137
60	388
61	93
62	14
63	1

[1, 3, 2, 1, 7, 8, 8, 4, 1, 15, 22, 31, 28, 17, 6, 1, 31, 52, 90, 112, 104, 68, 30, 8, 1, 63, 114, 225, 344, 418, 388, 270, 136, 47, 10, 1, 127, 240, 516, 908, 1331, 1568, 1464, 1064, 589, 240, 68, 12, 1, 255, 494, 1123, 2180, 3663, 5138, 5931, 5560, 4181, 2482, 1137, 388, 93, 14, 1]

cp's OEIS Frontend

A192020 Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the binomial tree of order n (1 <= k <= 2n-1; entries in row n are the coefficients of the corresponding Wiener polynomial).

Table of values

List of values