10199069190domain: NAppears in sequencesNumber of n-colorings of the Hypercube Graph Q4.at n=6A158348Table 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=59A342128