32938264

Appears in sequences

• Number of (n+1)X(3+1) 0..5 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=4A233953
• Number of (n+1)X(5+1) 0..5 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=2A233955
• T(n,k)=Number of (n+1)X(k+1) 0..5 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=23A233958
• T(n,k)=Number of (n+1)X(k+1) 0..5 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=25A233958