Binary Numbers Arranged

[Leroy Quet]

I wrote:
>What is the sequence where the nth term, a(n), is the number of 
>permutations of (1,2,3,...,n) written in binary so that no adjacent 
>elements share a common 1-bit?
>
>...

>I get, as done by hand, the sequence:
>1,2,0,4,2,0,0,0,0,20,...
>
>If I did not make a mistake, and I very well could have, this sequence is 
>not yet in the EIS.
>
>Could someone please calculate/submit the sequence if it is not yet in 
>the EIS?
>
>....

David Wasserman emailed to tell me that a(9) = 8.

I think now that a(10) = 32, not 20.
(I had thought that 3 {0011} had to be the 3rd term, following 7 {0111} 
then 8 {1000} {or had to be the 3rd from the end, preceding 8 then 7}.
I had forgotten that 3 could be the last term too. Any other permutations 
I missed?)

Maybe someone could use a brute-force program to check the values of this 
sequence.
(I am far from confident now about even the first 10 terms.)
Maybe it is in the EIS after all.

thanks,
Leroy Quet