Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Mar 19 2023 14:01:50
%S 1,1,2,0,0,2,4,0,0,0,0,432,1968,24960,161280,0,0,0,0,0,0,0,0,
%T 24492908160,314562424320,6409032860160,87275109519360,
%U 546113470694400,5633855851438080,119328558793113600,1461417642226483200,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N Number of circular permutations of {1, 2, ..., n} such that in every pair of adjacent elements each element in binary notation has ones at the same or adjacent positions to those of the other element.
%F If 2^(k+1) < = n < 3*2^k for k >= 1, then a(n) = 0.
%Y Cf. A115506, A115507, A115508.
%K nonn
%O 1,3
%A _Max Alekseyev_, Jan 31 2006
%E a(22)-a(47) from _Max Alekseyev_, Mar 19 2023