8198512

Appears in sequences

• Number of (n+1)X(3+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 35.at n=5A233899
• Number of (n+1)X(6+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 35.at n=2A233902
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 35 (35 maximizes T(1,1)).at n=30A233903