292864

Appears in sequences

• a(n) = binomial(n,3)*2^(n-3).at n=10A001789
• Highest degree of an irreducible representation of symmetric group S_n of degree n.at n=14A003040
• Number of simple allowable sequences on 1..n containing the permutation 12...n.at n=6A005118
• a(1) = 11; for n > 0, a(n+1) = a(n) * sum of digits of a(n).at n=5A047902
• Triangle read by rows: T(n,m) = 4^m * (2*n+1)! / ( (2*n - 2*m + 1)! * (2*m)! ), row n has n+1 terms.at n=26A085840
• Triangle T(n,k), n>=0, 0<=k<=C(n,2), read by rows: T(n,k) = number of k-length saturated chains in the poset of Dyck paths of semilength n ordered by inclusion.at n=41A193536
• 3-quantum transitions in systems of N>=3 spin 1/2 particles, in columns by combination indices.at n=30A213345
• Number A(n,k) of standard Young tableaux for partitions of n into distinct parts with largest part <= k; triangle A(n,k), k>=0, 0<=n<=k*(k+1)/2, read by columns.at n=40A219272
• Number T(n,k) of standard Young tableaux for partitions of n into distinct parts with largest part k; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns.at n=25A219274
• Number T(n,k) of standard Young tableaux for partitions of n into exactly k distinct parts; triangle T(n,k), n>=0, 0<=k<=A003056(n), read by rows.at n=60A219311
• Number of standard Young tableaux for partitions of n into exactly 5 distinct parts.at n=0A219318
• Number of standard Young tableaux for partitions of n into distinct parts with largest part floor(sqrt(2*n)+1/2).at n=15A219339
• Number of nonnegative integers with property that their base 8/5 expansion (see A024647) has n digits.at n=23A245420
• Irregular triangle read by rows: T(n,k) is the number of integers greater than 4 such that they have n trits and 2k+1 (k>=1) nonzero trits in their balanced ternary representation, with n>=3 and 1<=k<=(j-1)/2.at n=40A277513
• Number T(n,k) of reduced decompositions for all permutations of [n] with exactly k inversions; triangle T(n,k), n>=0, 0<=k<=n*(n-1)/2, read by rows.at n=40A289778
• Number T(n,k) of reduced decompositions for all permutations of [n] with exactly k inversions; triangle T(n,k), n>=0, 0<=k<=n*(n-1)/2, read by rows.at n=41A289778
• Triangle read by rows: T(n,k) = 4^k*binomial(n+k, n-k) with 0 <= k <= n.at n=41A373547
• Triangle read by rows: T(n, k) = 2^(2*n)*JacobiP(n - k, k, -1/2 - n, -1).at n=33A380865