40040

Appears in sequences

• a(n) = 5*binomial(n, 6).at n=16A000910
• Number of tree-rooted bridgeless planar maps with two vertices and n faces.at n=9A002740
• Degrees of irreducible representations of Suzuki group Suz.at n=19A003902
• exp(arctanh(x)*arcsin(x))=1+2/2!*x^2+24/4!*x^4+718/6!*x^6+40040/8!*x^8...at n=4A012723
• Number of ways to place a non-attacking white and black queen on n X n chessboard.at n=14A035291
• Triangle read by rows, the Bell transform of the triple factorial numbers A007559(n+1) without column 0.at n=24A035469
• Maximal value of products of partitions of n into powers of distinct primes (1 not considered a power).at n=44A051703
• Number of sequences {s(i): i=0..n} such that |s(i)-s(i-1)|=1, i=1..n and s(i)=0 at four values of i, one of which is i=0.at n=17A052207
• A simple context-free grammar: convolution square of A001002.at n=10A052706
• Smallest multiple of n using only digits 0 and 4.at n=34A078243
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).at n=38A085880
• Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A000108).at n=42A085880
• Numbers n divisible by exactly two nontrivial permutations (rearrangements) of the digits of n.at n=32A090057
• Array read by rows: T(n,k) = binomial(n+k-2,k-1)*binomial(2*n-1,n-k).at n=29A091811
• a(n) = lcm{1, 2, ..., n}/(n*(n-1)), n >= 2.at n=16A099946
• Denominators of the convergents in the continued fraction expansion for the constant given by A100338, where the partial quotients equal A006519 (greatest power of 2 dividing n).at n=13A100341
• Triangle T(n,k) read by rows: number of 12312-avoiding matchings on [2n] with exactly k crossings (n >= 1, 0 <= k <= n-1).at n=38A108410
• Denominator of n-th term of the harmonic series after removal of all terms 1/m from Sum_{m=1..n} 1/m for which m contains a 9 in its decimal representation.at n=13A111936
• Triangle read by rows: T(n,k)=2^k*binomial(2n-k,n-k), 1<=k<=n.at n=38A112326
• Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n, having k ascents of length at least 2 (1 <= k <= floor(n/2), n >= 2).at n=40A114593