A342128 - cp's OEIS frontend

A342128 Table read by antidiagonals upwards: T(n,k) is the number of n-colorings of the vertices of the k-dimensional hypercube such that no two adjacent vertices have the same color. n >= 0, k >=0.

n	a(n)
0	0
1	1
2	0
3	2
4	0
5	0
6	3
7	2
8	0
9	0
10	4
11	6
12	2
13	0
14	0
15	5
16	12
17	18
18	2
19	0
20	0
21	6
22	20
23	84
24	114
25	2
26	0
27	0
28	7
29	30
30	260
31	2652
32	2970
33	2
34	0
35	0
36	8
37	42
38	630
39	29660
40	1321860
41	1185282
42	2
43	0
44	0
45	9
46	56
47	1302
48	198030
49	187430900
50	130253748108
51	100301050602
52	2
53	0
54	0
55	10
56	72
57	2408
58	932862
59	10199069190
60	2157531034816940

[0, 1, 0, 2, 0, 0, 3, 2, 0, 0, 4, 6, 2, 0, 0, 5, 12, 18, 2, 0, 0, 6, 20, 84, 114, 2, 0, 0, 7, 30, 260, 2652, 2970, 2, 0, 0, 8, 42, 630, 29660, 1321860, 1185282, 2, 0, 0, 9, 56, 1302, 198030, 187430900, 130253748108, 100301050602, 2, 0, 0, 10, 72, 2408, 932862, 10199069190, 2157531034816940]

cp's OEIS Frontend

A342128 Table read by antidiagonals upwards: T(n,k) is the number of n-colorings of the vertices of the k-dimensional hypercube such that no two adjacent vertices have the same color. n >= 0, k >=0.

Table of values

List of values