27410

Appears in sequences

• Triangle read by rows: T(n,k) is the number of binary trees with n edges and k jumps (n >= 0, 0 <= k <= max(0,ceiling(n/2)-1) ).at n=27A127530
• Triangle T(n, k) = binomial(n+1, k)*A142458(n+1, k+1)/(k+1), read by rows.at n=17A155491
• Triangle T(n, k) = binomial(n+1, k)*A142458(n+1, k+1)/(k+1), read by rows.at n=18A155491
• a(n) = A142458(2*n-1, n)/n.at n=3A172018
• Number of magic labelings of the prism graph I X C_6 having magic sum n.at n=6A292281
• Numbers k such that 8k+1, 12k+1 and 24k+1 are primes and the last two are also of the form x^2 + 27y^2, so the tetrahedral number T(24k+1) is a Fermat pseudoprime to base 2.at n=18A321867
• Non-Brauer numbers.at n=17A349044