6745200

Appears in sequences

• T(n,k) is the number of size k ordered submultisets of the regular multiset {1_1,1_2,...,1_(n-1),1_n, ... ,i_1,i_2,...,i_(n-1),i_n, ... ,n_1,n_2,...,n_(n-1),n_n} (which contains n copies of i for 1 <= i <= n).at n=30A234574
• Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 4 where empty bins are permitted (m >= 1, 1 <= n <= 4m).at n=35A248846
• a(n) = Sum_{x_1+x_2+x_3+x_4=n, 0 <= x_1, x_2, x_3, x_4 <= n} (3*n)!/((n-x_1)! * (n-x_2)! * (n-x_3)! * (n-x_4)!).at n=4A348700
• a(n) = Sum_{x_1+x_2+ ... +x_n=n, 0 <= x_1, x_2, ... , x_n <= n} ((n-1)*n)!/((n-x_1)! * (n-x_2)! * ... * (n-x_n)!).at n=4A348703