A235113 - cp's OEIS frontend

A235113 Irregular triangle read by rows: T(n,k) = number of independent vertex subsets of size k of the graph g_n obtained by attaching two pendant edges to each vertex of the complete graph K_n (0 <= k <= 2n).

n	a(n)
0	1
1	1
2	3
3	1
4	1
5	6
6	10
7	6
8	1
9	1
10	9
11	27
12	38
13	27
14	9
15	1
16	1
17	12
18	52
19	116
20	150
21	116
22	52
23	12
24	1
25	1
26	15
27	85
28	260
29	490
30	602
31	490
32	260
33	85
34	15
35	1
36	1
37	18
38	126
39	490
40	1215
41	2052
42	2436
43	2052
44	1215
45	490
46	126
47	18
48	1
49	1
50	21
51	175
52	826
53	2541
54	5467
55	8547
56	9900
57	8547
58	5467
59	2541
60	826
61	175
62	21
63	1

[1, 1, 3, 1, 1, 6, 10, 6, 1, 1, 9, 27, 38, 27, 9, 1, 1, 12, 52, 116, 150, 116, 52, 12, 1, 1, 15, 85, 260, 490, 602, 490, 260, 85, 15, 1, 1, 18, 126, 490, 1215, 2052, 2436, 2052, 1215, 490, 126, 18, 1, 1, 21, 175, 826, 2541, 5467, 8547, 9900, 8547, 5467, 2541, 826, 175, 21, 1]

cp's OEIS Frontend

A235113 Irregular triangle read by rows: T(n,k) = number of independent vertex subsets of size k of the graph g_n obtained by attaching two pendant edges to each vertex of the complete graph K_n (0 <= k <= 2n).

Table of values

List of values