A213666 - cp's OEIS frontend

A213666 Irregular triangle read by rows: T(n,k) is the number of dominating subsets with k vertices of the graph G(n) obtained by taking n copies of the path P_3 and identifying one of their endpoints (a star with n branches of length 2).

n	a(n)
1	1
2	3
3	1
4	0
5	3
6	8
7	5
8	1
9	0
10	0
11	7
12	20
13	18
14	7
15	1
16	0
17	0
18	0
19	15
20	48
21	56
22	32
23	9
24	1
25	0
26	0
27	0
28	0
29	31
30	112
31	160
32	120
33	50
34	11
35	1
36	0
37	0
38	0
39	0
40	0
41	63
42	256
43	432
44	400
45	220
46	72
47	13
48	1
49	0
50	0
51	0
52	0
53	0
54	0
55	127
56	576
57	1120
58	1232
59	840
60	364
61	98
62	15
63	1

[1, 3, 1, 0, 3, 8, 5, 1, 0, 0, 7, 20, 18, 7, 1, 0, 0, 0, 15, 48, 56, 32, 9, 1, 0, 0, 0, 0, 31, 112, 160, 120, 50, 11, 1, 0, 0, 0, 0, 0, 63, 256, 432, 400, 220, 72, 13, 1, 0, 0, 0, 0, 0, 0, 127, 576, 1120, 1232, 840, 364, 98, 15, 1]

cp's OEIS Frontend

A213666 Irregular triangle read by rows: T(n,k) is the number of dominating subsets with k vertices of the graph G(n) obtained by taking n copies of the path P_3 and identifying one of their endpoints (a star with n branches of length 2).

Table of values

List of values