A213660 - cp's OEIS frontend

A213660 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 cycle graph C_3 with a vertex in common.

n	a(n)
1	3
2	3
3	1
4	1
5	8
6	10
7	5
8	1
9	1
10	6
11	23
12	32
13	21
14	7
15	1
16	1
17	8
18	28
19	72
20	102
21	80
22	36
23	9
24	1
25	1
26	10
27	45
28	120
29	242
30	332
31	290
32	160
33	55
34	11
35	1
36	1
37	12
38	66
39	220
40	495
41	856
42	1116
43	1032
44	655
45	280
46	78
47	13
48	1
49	1
50	14
51	91
52	364
53	1001
54	2002
55	3131
56	3880
57	3675
58	2562
59	1281
60	448
61	105
62	15
63	1

[3, 3, 1, 1, 8, 10, 5, 1, 1, 6, 23, 32, 21, 7, 1, 1, 8, 28, 72, 102, 80, 36, 9, 1, 1, 10, 45, 120, 242, 332, 290, 160, 55, 11, 1, 1, 12, 66, 220, 495, 856, 1116, 1032, 655, 280, 78, 13, 1, 1, 14, 91, 364, 1001, 2002, 3131, 3880, 3675, 2562, 1281, 448, 105, 15, 1]

cp's OEIS Frontend

A213660 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 cycle graph C_3 with a vertex in common.

Table of values

List of values