14743812

Appears in sequences

• Number of (n+1)X(4+1) 0..4 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11.at n=4A234213
• Number of (n+1)X(5+1) 0..4 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11.at n=3A234214
• T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)).at n=31A234217
• Irregular triangle read by rows: T(n,k) = [x^k] (1+x) * A_n(x)^2, where A_n(x) is the n-th Eulerian polynomial.at n=50A382232
• Irregular triangle read by rows: T(n,k) = [x^k] (1+x) * A_n(x)^2, where A_n(x) is the n-th Eulerian polynomial.at n=51A382232