496128

Appears in sequences

• Graham-Sloane-type lower bound on the size of a ternary (n,3,8) constant-weight code.at n=11A030508
• Factorial splitting: write n! = x*y*z with x<y<z and x maximal and z is minimal; sequence gives value of z.at n=16A061032
• If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 5-subsets of X containing none of X_i, (i=1,...n).at n=15A130811
• Number of length 3+3 0..n arrays with some pair in every consecutive four terms totalling exactly n.at n=10A245953
• Factorial splitting: write n! = x*y*z with x <= y <= z and minimal z-x; sequence gives value of z.at n=19A355191
• Triangle read by rows. Coefficients of the polynomials P(n, x) = 2^(n-2)*(3*n-1)* hypergeometric([-3*n, 1 - n, -n + 4/3], [-n, -n + 1/3], x). T(n, k) = [x^k] P(n, x).at n=27A358091
• a(n) = 2^n * binomial(4*n,n).at n=5A386918