937365

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=9A007226
• Duplicate of A007226.at n=9A024484
• a(n) = Product_{i=0..n} prime(i+1)^(Fibonacci(i) mod 2).at n=8A120467
• a(n) = Product_{i=0..n} prime(i+1)^(Fibonacci(i) mod 2).at n=9A120467
• Number of ternary trees with n edges and such that the first leaf in the preorder traversal is at level 1.at n=9A121446
• Array t(n,k) = binomial(n*k, n+1)/n, where n >= 1 and k >= 2, read by ascending antidiagonals.at n=46A241262
• The primitive abundant numbers k (A071395) arranged by the decreasing values of their abundancy index sigma(k)/k.at n=29A307098
• a(n) is the denominator of the sum of reciprocals of primes not exceeding n and not dividing binomial(2*n, n).at n=26A334075
• a(n) = binomial(3*n,n)/(2*n + 1) - 2*binomial(3*(n - 1),n - 1)/(2*n - 1) for n > 0 with a(0) = 1.at n=10A336945