112504

Appears in sequences

• Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=7A235179
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=28A235186
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=35A235186
• G.f. = b(2)*b(4)*b(6)/(x^8+x^7-x^3-x^2-x+1), where b(k) = (1-x^k)/(1-x).at n=17A266375
• Consider primitive solutions (x,y,z) to the system x+y+z = r^2, x^2+y^2+z^2 = s^2, x^3+y^3+z^3 = t^2, with 0<x<=y<=z arranged in order of increasing z; sequence gives y values.at n=8A327339