139536

Appears in sequences

• a(n) = 2*(n+1)*binomial(n+2,4).at n=15A027777
• Number of bracelets (turnover necklaces) of n beads of 2 colors, 7 of them black.at n=30A032280
• a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=0, a(1)=1.at n=9A090017
• a(n) = gcd(F(n), product{k|n,k<n} F(k)), where F(k) is k-th Fibonacci number.at n=35A111079
• Triangle P, read by rows, that satisfies [P^6](n,k) = P(n+1,k+1) for n>=k>=0, also [P^(6*m)](n,k) = [P^m](n+1,k+1) for all m, where [P^m](n,k) denotes the element at row n, column k, of the matrix power m of P, with P(0,k)=1 and P(k,k)=1 for all k>=0.at n=18A111825
• Total number of possible knight moves on an n X n X n chessboard, if the knight is placed anywhere.at n=17A180413
• a(n) = gcd(n!, Fibonacci(n)).at n=35A247193
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 393", based on the 5-celled von Neumann neighborhood.at n=23A281742
• a(n) = binomial(n+3, 3)*(1 + binomial(n+2, 3)/4).at n=15A291288
• a(n) = 12*binomial(n, 5).at n=19A300847
• a(n) = n*(2*n-1)*a(n-1) + ((n-1)!)^2, with a(0) = 0, n > 0.at n=5A303109
• a(n) is the number of subsets of {1..n} that contain exactly 2 odd and 3 even numbers.at n=37A330300
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of g.f. 1/(1 - 2*k*x - k*x^2).at n=63A342134
• Number of 4-cycles in the n X n white bishop graph.at n=35A367993