622080000

Appears in sequences

• Let k(n) = mod(3,n)-1. Then a(n) = 4*a(n-1) if n is odd, otherwise ((5+k(n))/4)*a(n-1), with a(0) = 1, a(1) = 2.at n=26A123761
• Number of (n+2) X (n+2) 0..2 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=2A250593
• Number of (n+2) X (3+2) 0..2 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=2A250596
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with nondecreasing sum of every three consecutive values in every row and column.at n=12A250601