198030

Appears in sequences

• Number of n-colorings of the cubical graph.at n=6A140986
• Square array A(n,k) (n>=1, k>=1) read by antidiagonals: A(n,k) is the number of n-colorings of the prism graph Y_k on 2k vertices.at n=41A277443
• 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=48A342128