253072

Appears in sequences

• Solution to the Dancing School Problem with 9 girls and n+9 boys: f(9,n).at n=5A079914
• Solution to the Dancing School Problem with n girls and n+5 boys: f(n,5).at n=8A079924
• Number of (n+1) X 4 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock the same.at n=4A205250
• Number of (n+1)X6 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=2A205252
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=23A205255
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same.at n=25A205255
• Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any element within a city block distance of two, and containing the value n(n+1)/2-4.at n=5A212041
• T(n,k)=Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any element within a city block distance of two, and containing the value n(n+1)/2-k-1.at n=33A212044