126688

Appears in sequences

• Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 1 1 vertically.at n=6A207925
• Number of 7Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 1 1 vertically.at n=4A207933
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,1 0,-1 0,2 1,0 -1,0 or 2,0.at n=5A264159
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 -1,0 or 2,0.at n=22A264163
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 -1,0 or 2,0.at n=26A264163
• Expansion of Product_{k>=1} (1 + x^(2*k-1))^(k*(3*k-2))*(1 + x^(2*k))^(k*(3*k+2)).at n=14A294841