354816

Appears in sequences

• One half of deca-factorial numbers.at n=4A035265
• Weight enumerator of [64,36,12] extended BCH code.at n=7A109485
• Weight enumerator of [64,36,12] extended BCH code.at n=25A109485
• a(n) = n*binomial(2*n, n)*Fibonacci(n)^2.at n=6A119700
• a(n) = 4*(3*n+2)*(2*n+1)*(n+2)*(n+1).at n=11A155122
• Asymmetrical triangle sequence:t(n,m)=(-1)^m* Binomial[n, m] Pochhammer[ -n, m] - (-1)^n Pochhammer[ -n, n] + (-1)^( n - m)* Binomial[n, -m + n] Pochhammer[ -n, -m + n].at n=39A176063
• Asymmetrical triangle sequence:t(n,m)=(-1)^m* Binomial[n, m] Pochhammer[ -n, m] - (-1)^n Pochhammer[ -n, n] + (-1)^( n - m)* Binomial[n, -m + n] Pochhammer[ -n, -m + n].at n=41A176063
• 4-quantum transitions in systems of N>=4 spin 1/2 particles, in columns by combination indices.at n=21A213346
• Record values of gcd(sigma(n), phi(n)) (A009223).at n=42A222712
• Triangle read by rows: T(n,k) is the number of preimages of the permutation 21345...n under West's stack-sorting map that have k+1 valleys (1 <= k <= floor((n-1)/2)).at n=39A317555
• a(n) is the smallest number m with exactly n divisors that are Zuckerman numbers, or -1 if there is no such m.at n=25A335038
• a(n) = (2*n)! * hypergeom([3/2, 2, 1-n], [3, 2 - 2*n], 4) for n >= 1 and a(0) = 1.at n=4A344056
• Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle.at n=20A362144
• Obverse convolution (1)**A001950; see Comments.at n=6A374864