46068

Appears in sequences

• a(1) = 1; then add 1, multiply by 2, subtract 3, multiply by 4, add 5, multiply by 6, subtract 7, multiply by 8 and so on.at n=12A085111
• Number of 3 X n 0..1 arrays with rows, diagonals and antidiagonals unimodal.at n=8A223670
• Triangle T(n, k) = Numbers of inequivalent (mod D_3) ways to place k points on a triangular grid of side n so that no three of them are vertices of an equilateral triangle of any orientation. Triangle read by rows.at n=47A243141
• Number of inequivalent (mod D_3) ways to place 5 points on a triangular grid of side n so that they are not vertices of an equilateral triangle of any orientation.at n=5A243144
• Triangle, read by rows, T(n,k) = k*Sum_{i=0..n-k} C(2*i+2*k,i)*C(n-i-1,k-1)/(i+k) for 1 <= k <= n.at n=48A257488
• Number of tetrahedra in the n X n white bishop graph.at n=20A391027