411848

Appears in sequences

• Number of nX5 0..1 arrays avoiding 0 0 1 and 1 0 0 horizontally and 0 1 1 and 1 1 0 vertically.at n=7A208004
• Number of (n+1)X(2+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 26.at n=3A233660
• Number of (n+1)X(4+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 26.at n=1A233662
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 26 (26 maximizes T(1,1)).at n=11A233665
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 26 (26 maximizes T(1,1)).at n=13A233665