19123682

Appears in sequences

• Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2.at n=5A233639
• Number of (n+1)X(6+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2.at n=2A233642
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2 (2 maximizes T(1,1)).at n=30A233644
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2 (2 maximizes T(1,1)).at n=33A233644