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 #12 Mar 13 2018 04:09:25
%S 1,1,1,1,2,5,24,26,672,246,3755388,13827240,1768910220,99034598880,
%T 1463488641762840,612823600,171768365608799778,16338317307187487976,
%U 27491145139913884194480,14794457633180140325810400,2084886621890359572790082258379649440
%N a(n) = least common multiple of all cycle sizes in range [2^(n-1),(2^n)-1] of permutation A209861/A209862.
%C a(0) gives the LCM of cycle sizes in range [0,0], i.e., 1.
%H Antti Karttunen, <a href="/A209866/a209866.txt">Listing showing a more detailed cycle-structure of permutations A209861/A209862 up to n=20.</a>
%e In range [2^(6-1),(2^6)-1] ([32,63]) of permutations A209861 & A209862, there are 6 cycles of size 1 (fixed points), 2 cycles of size 3, one cycle of size 4, and 2 cycles of size 8 (6 + 2*3 + 4 + 2*8 = 32), thus a(6) = lcm(1,3,4,8) = 24.
%Y Cf. A209863, A209864, A209865, A209867.
%K nonn
%O 0,5
%A _Antti Karttunen_, Mar 24 2012