A213669 - cp's OEIS frontend

A213669 Irregular triangle read by rows: T(n,k) is the number of dominating subsets with k vertices of the double star graph G(n) obtained by joining with an edge the centers of two star trees each having n+1 vertices (n>=1, k>=2).

n	a(n)
1	4
2	4
3	1
4	1
5	6
6	11
7	6
8	1
9	1
10	6
11	17
12	26
13	22
14	8
15	1
16	1
17	8
18	28
19	58
20	78
21	68
22	37
23	10
24	1
25	1
26	10
27	45
28	120
29	212
30	262
31	230
32	140
33	56
34	12
35	1
36	1
37	12
38	66
39	220
40	495
41	794
42	936
43	822
44	535
45	250
46	79
47	14
48	1
49	1
50	14
51	91
52	364
53	1001
54	2002
55	3005
56	3446
57	3045
58	2072
59	1071
60	406
61	106
62	16
63	1

[4, 4, 1, 1, 6, 11, 6, 1, 1, 6, 17, 26, 22, 8, 1, 1, 8, 28, 58, 78, 68, 37, 10, 1, 1, 10, 45, 120, 212, 262, 230, 140, 56, 12, 1, 1, 12, 66, 220, 495, 794, 936, 822, 535, 250, 79, 14, 1, 1, 14, 91, 364, 1001, 2002, 3005, 3446, 3045, 2072, 1071, 406, 106, 16, 1]

cp's OEIS Frontend

A213669 Irregular triangle read by rows: T(n,k) is the number of dominating subsets with k vertices of the double star graph G(n) obtained by joining with an edge the centers of two star trees each having n+1 vertices (n>=1, k>=2).

Table of values

List of values