117232

Appears in sequences

• Number of triangles in an n X n unit grid that have minimal possible area (of 1/2).at n=20A088658
• Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=4A235064
• Number of (n+1) X (5+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=0A235068
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=10A235071
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=14A235071
• Condensed deep factorization of n, A300562(n) written in decimal: floor of odd part of A300561(n) divided by 2.at n=20A300563
• G.f. A(x) satisfies: 0 = Sum_{n=-oo..+oo} x^(n^2) * (x^n - (-1)^n*A(x))^(n+1).at n=9A355152