314753

Appears in sequences

• Triangle T(n,k) read by rows: Number of non-equivalent ways (mod D_3) to choose k points from an nXnXn triangular grid so that no three of them form a 2X2X2 subtriangle.at n=50A234247
• Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=5A252676
• Number of (6+2)X(n+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 5 6 or 7.at n=4A252685