250708

Appears in sequences

• Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2.at n=28A180826
• Constant term in the reduction by (x^2 -> x + 1) of the polynomial p(n,x) given in Comments.at n=14A192878
• Number of (n+1) X (2+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=3A235170
• Number of (n+1) X (4+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=1A235172
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=11A235175
• T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=13A235175
• Number of (n+1)X(2+1) 0..2 arrays colored with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock.at n=3A236665
• Number of (n+1)X(4+1) 0..2 arrays colored with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock.at n=1A236667
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock.at n=11A236669
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the lower median minus the upper median minus the minimum of every 2X2 subblock.at n=13A236669