193530

Appears in sequences

• Triangle read by rows: T(n,k) number of ways of partitioning the (n+3)-element multiset {1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 3.at n=82A291118
• Number of minimal total dominating sets in the 4 X n king graph.at n=9A332394