163438

Appears in sequences

• a(n) = 2*det(M(n; -1))/det(M(n; 0)), where M(n; m) is the n X n matrix with (i,j)-th element equal to 1/binomial(n + i + j + m, n).at n=8A007226
• Duplicate of A007226.at n=8A024484
• Number of ways to place 2 nonattacking kings on an n X n board.at n=24A061995
• Least m such that A078142(m) = A006530(m) = n-th prime.at n=8A078328
• Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).at n=17A094063
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and such that the first leaf in the preorder traversal is at level k (1<=k<=n). A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=36A121445
• Number of ternary trees with n edges and such that the first leaf in the preorder traversal is at level 1.at n=8A121446
• Number of distinct solutions of sum{i=1..9}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1.at n=4A180811
• Array t(n,k) = binomial(n*k, n+1)/n, where n >= 1 and k >= 2, read by ascending antidiagonals.at n=37A241262
• Number of non-equivalent ways under symmetry in one axis that 2 non-attacking kings of different colors can be placed on an n X n board.at n=23A357740
• a(n) = 20*(3*n)!/((2*n)!*(n+2)!).at n=8A361037