A235116 - cp's OEIS frontend

A235116 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 path graph P_n (having n vertices).

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	28
12	40
13	28
14	9
15	1
16	1
17	12
18	55
19	128
20	168
21	128
22	55
23	12
24	1
25	1
26	15
27	91
28	297
29	584
30	728
31	584
32	297
33	91
34	15
35	1
36	1
37	18
38	136
39	574
40	1519
41	2672
42	3216
43	2672
44	1519
45	574
46	136
47	18
48	1
49	1
50	21
51	190
52	986
53	3297
54	7553
55	12272
56	14400
57	12272
58	7553
59	3297
60	986
61	190
62	21
63	1

[1, 1, 3, 1, 1, 6, 10, 6, 1, 1, 9, 28, 40, 28, 9, 1, 1, 12, 55, 128, 168, 128, 55, 12, 1, 1, 15, 91, 297, 584, 728, 584, 297, 91, 15, 1, 1, 18, 136, 574, 1519, 2672, 3216, 2672, 1519, 574, 136, 18, 1, 1, 21, 190, 986, 3297, 7553, 12272, 14400, 12272, 7553, 3297, 986, 190, 21, 1]

cp's OEIS Frontend

A235116 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 path graph P_n (having n vertices).

Table of values

List of values