89256

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=25A088960
• Binomial transform of (Jacobsthal(n) + 2^n*Jacobsthal(-n))/2.at n=12A094039
• Number of ways to place n nonattacking bishops on black squares of a 2n X 2n board.at n=5A191236
• 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=52A274105
• 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=51A274106
• a(n) = (1/6)*(3^n + (-2)^n - 1).at n=11A344747
• Lower (1/3,1/2)-midsequence of ((2^n)) and ((3^n)); see Comments.at n=11A389123