66372
domain: N
Appears in sequences
- Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.at n=3A264549
- 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 -1,1 -1,2 1,0 or 0,-1.at n=48A264550
- Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.at n=6A264553
- a(n) = coefficient of x^(2*n) in A(x) such that A(x) = G(x)^2 where G(x) = 1 + Sum_{n>=1} (-1)^n * x^(4*n^2) * (F(x/2)^(2*n) + F(-x/2)^(2*n)), and F(x) is the g.f. of A357787.at n=16A357803