A235117 - cp's OEIS frontend

A235117 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 ladder graph L_n (i.e., L_n is the 2 X n grid graph; 0 <= k <= 4n+1).

n	a(n)
0	1
1	1
2	6
3	10
4	6
5	1
6	1
7	12
8	54
9	124
10	162
11	124
12	54
13	12
14	1
15	1
16	18
17	134
18	556
19	1451
20	2530
21	3036
22	2530
23	1451
24	556
25	134
26	18
27	1
28	1
29	24
30	250
31	1516
32	6042
33	16892
34	34430
35	52352
36	60122
37	52352
38	34430
39	16892
40	6042
41	1516
42	250
43	24
44	1
45	1
46	30
47	402
48	3220
49	17393
50	67676
51	197588
52	444584
53	784702
54	1098826
55	1228500
56	1098826
57	784702
58	444584
59	197588
60	67676
61	17393
62	3220
63	402
64	30
65	1

[1, 1, 6, 10, 6, 1, 1, 12, 54, 124, 162, 124, 54, 12, 1, 1, 18, 134, 556, 1451, 2530, 3036, 2530, 1451, 556, 134, 18, 1, 1, 24, 250, 1516, 6042, 16892, 34430, 52352, 60122, 52352, 34430, 16892, 6042, 1516, 250, 24, 1, 1, 30, 402, 3220, 17393, 67676, 197588, 444584, 784702, 1098826, 1228500, 1098826, 784702, 444584, 197588, 67676, 17393, 3220, 402, 30, 1]

cp's OEIS Frontend

A235117 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 ladder graph L_n (i.e., L_n is the 2 X n grid graph; 0 <= k <= 4n+1).

Table of values

List of values