187430900

Appears in sequences

• Number of n-colorings of the Hypercube Graph Q4.at n=5A158348
• 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.at n=49A342128