327588

Appears in sequences

• Number of (n+1)X(2+1) 0..3 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=5A233685
• Number of (n+1)X(6+1) 0..3 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=1A233689
• T(n,k)=Number of (n+1)X(k+1) 0..3 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=22A233691
• T(n,k)=Number of (n+1)X(k+1) 0..3 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=26A233691
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 417", based on the 5-celled von Neumann neighborhood.at n=19A282068