138132

Appears in sequences

• Number of (n+1)X(2+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30, and no two adjacent values equal.at n=3A233911
• Number of (n+1)X(4+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30, and no two adjacent values equal.at n=1A233913
• T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal.at n=11A233917
• T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal.at n=13A233917
• G.f. A(x) satisfies: A(x) = x + x^2 * exp(4 * Sum_{k>=1} (-1)^(k+1) * A(x^k) / k).at n=10A345245