A369605 - cp's OEIS frontend

A369605 Irregular triangle read by rows: T(n,k) is the number of inequivalent connected induced k-vertex subgraphs of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	3
11	2
12	3
13	1
14	1
15	1
16	1
17	1
18	3
19	5
20	11
21	19
22	36
23	37
24	41
25	24
26	18
27	6
28	4
29	1
30	1
31	1
32	1
33	1
34	3
35	5
36	17
37	44
38	158
39	493
40	1628
41	4670
42	12266
43	27043
44	51018
45	79042
46	103179
47	112219
48	105232
49	84045
50	59021
51	35533
52	19114
53	8769
54	3716
55	1311
56	468
57	130
58	47
59	10
60	5
61	1
62	1

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 1, 1, 3, 5, 11, 19, 36, 37, 41, 24, 18, 6, 4, 1, 1, 1, 1, 1, 3, 5, 17, 44, 158, 493, 1628, 4670, 12266, 27043, 51018, 79042, 103179, 112219, 105232, 84045, 59021, 35533, 19114, 8769, 3716, 1311, 468, 130, 47, 10, 5, 1, 1]

cp's OEIS Frontend

A369605 Irregular triangle read by rows: T(n,k) is the number of inequivalent connected induced k-vertex subgraphs of the hypercube graph of dimension n >= 0, 1 <= k <= 2^n.

Table of values

List of values