2585024

Appears in sequences

• Number of (n+1) X 4 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.at n=25A205188
• a(n) = Pell(n)*A034896(n) for n >= 1, with a(0)=1, where A034896 lists the number of solutions to a^2 + b^2 + 3*c^2 + 3*d^2 = n.at n=14A209451
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = 4^(2*(n-1)*(k-1)) * Product_{a=1..n-1} Product_{b=1..k-1} (1 - sin(a*Pi/(2*n))^2 * sin(b*Pi/(2*k))^2).at n=29A340427
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = 4^(2*(n-1)*(k-1)) * Product_{a=1..n-1} Product_{b=1..k-1} (1 - sin(a*Pi/(2*n))^2 * sin(b*Pi/(2*k))^2).at n=34A340427