38932

Appears in sequences

• Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n).at n=24A088960
• Triangular sequence defined by T(n, m) = Coefficients(q(x,n) + x^(n-2)*q(1/x,n))/4, where q(x, n) = d^2*p(x, n)/dx^2 and p(x, n) = 2^n*(1-x)^(n+1)*LerchPhi(x, -n, 1/2).at n=11A154706
• Triangular sequence defined by T(n, m) = Coefficients(q(x,n) + x^(n-2)*q(1/x,n))/4, where q(x, n) = d^2*p(x, n)/dx^2 and p(x, n) = 2^n*(1-x)^(n+1)*LerchPhi(x, -n, 1/2).at n=13A154706
• Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]).at n=51A274105
• Triangle read by rows: T(n,k) = total number of configurations of k nonattacking bishops on the white squares of an n X n chessboard (0 <= k <= n-1+[n=0]).at n=50A274106
• Number of perfect-powers x in the range 2^n < x < 2^(n+1).at n=33A377467