%I #8 Nov 19 2013 17:55:56
%S 0,0,0,10,226,8600,433220,28226254
%N Number of permutations of 1,...,2n with alternate odd/even entries that have no adjacent members.
%e The 10 for a(4) are:
%e [7, 4, 1, 6, 3, 8, 5, 2]
%e [5, 2, 7, 4, 1, 8, 3, 6]
%e [5, 2, 7, 4, 1, 6, 3, 8]
%e [1, 4, 7, 2, 5, 8, 3, 6]
%e [3, 8, 5, 2, 7, 4, 1, 6]
%e [3, 6, 1, 4, 7, 2, 5, 8]
%e [5, 8, 3, 6, 1, 4, 7, 2]
%e [3, 6, 1, 8, 5, 2, 7, 4]
%e [1, 6, 3, 8, 5, 2, 7, 4]
%e [7, 2, 5, 8, 3, 6, 1, 4]
%o (PARI) { for (i=1,6, c=0; for (j=1,i!, for (k=1,i!, x=numtoperm(i,j); y=numtoperm(i,k); v=vector(2*i); forstep (z=1,2*i,2, v[z]=x[(z+1)/2]*2-1); forstep (z=2,2*i,2, v[z]=y[z/2]*2); fl=1; for (z=1,2*i-1, if (v[z]==v[z+1]+1, fl=0;break); if (v[z]==v[z+1]-1, fl=0;break)); if (fl==1,c++))); print1(","c)) }
%Y Cf. A090931.
%K nonn
%O 1,4
%A _Jon Perry_, Feb 20 2004
%E a(7)-a(8) from _Alois P. Heinz_, Nov 19 2013