A346905 - cp's OEIS frontend

A346905 Triangle read by rows: T(n,k) is the number of ways of choosing a k-dimensional cube from the vertices of an n-dimensional hypercube; 0 <= k <= n.

n	a(n)
0	1
1	2
2	1
3	4
4	6
5	1
6	8
7	28
8	6
9	1
10	16
11	120
12	36
13	8
14	1
15	32
16	496
17	200
18	40
19	10
20	1
21	64
22	2016
23	1120
24	280
25	60
26	12
27	1
28	128
29	8128
30	6272
31	2240
32	280
33	84
34	14
35	1
36	256
37	32640
38	35392
39	15232
40	2800
41	448
42	112
43	16
44	1
45	512
46	130816
47	200832
48	103936
49	34272
50	2016
51	672
52	144
53	18
54	1

[1, 2, 1, 4, 6, 1, 8, 28, 6, 1, 16, 120, 36, 8, 1, 32, 496, 200, 40, 10, 1, 64, 2016, 1120, 280, 60, 12, 1, 128, 8128, 6272, 2240, 280, 84, 14, 1, 256, 32640, 35392, 15232, 2800, 448, 112, 16, 1, 512, 130816, 200832, 103936, 34272, 2016, 672, 144, 18, 1]

cp's OEIS Frontend

A346905 Triangle read by rows: T(n,k) is the number of ways of choosing a k-dimensional cube from the vertices of an n-dimensional hypercube; 0 <= k <= n.

Table of values

List of values