8284072

Appears in sequences

• Number of (n+1)X(3+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal.at n=5A233686
• Number of (n+1)X(6+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal.at n=2A233689
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal.at n=30A233691
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal.at n=33A233691