371016

Appears in sequences

• Triangle read by rows: T(n, k) is the number of ways to select k disjoint point triples from an n X n X n triangular point grid, each point triple forming a 2 X 2 X 2 triangle.at n=40A289222
• Number of ways to select 6 disjoint point triples from an n X n X n triangular point grid, each point triple forming a 2 X 2 X 2 triangle.at n=3A289227
• Number of minimal total dominating sets in the n-triangular (Johnson) graph.at n=9A303227