238570

Appears in sequences

• Row sums of Riordan array A110165.at n=8A110166
• 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=3A233639
• Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 2.at n=2A233640
• 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=17A233644
• 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=18A233644
• Numbers k with Goldbach partitions (p,q) and (r,s) such that k | (p*q -1) and k | (r*s +1).at n=26A336584