216864652

Appears in sequences

• a(n) = Sum_{i=1..n} Sum_{j=1..n} Sum_{k=1..n} (i+j+k)!/(3!*i!*j!*k!).at n=7A144511
• Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n.at n=48A144512
• Number of scenarios in the Gift Exchange Game when a gift can be stolen at most 6 times.at n=3A281358