Revisited:Permutations Involving Rel.-Primality

[Leroy Quet]

Many of you have already replied to the original post. What I am 
wondering about is the sequence variation mentioned at the end of this 
repost:

  A variation of the question: 
  What if a(1) must be relatively-prime to a(m) as well?

Is this variation of the sequence in the EIS already?

Thanks,
Leroy Quet


 From mid-November:

>What is the number of permutations of the first m positive integers
>where
>
>GCD(a(k-1), a(k)) = 1
>
>for all k, 2 <= k <= m,
>where a(k) is the k_th ordered element of each permutation?
>
>For example, if m = 5,
>then: 1, 3, 2, 5, 4 
>is one of the permutations that I wish to count, while:
>1, 3, 2, 4, 5
>is not. (2 and 4 next to each other)
>
>With a brute-force counting Mathematica program,
>I get the number-of-these-particular-permutations sequence beginning:
>
>1, 2, 6, 12, 72, 72, 864, 1728,...
>
>....
>
>A variation of the question: What if a(1) must be relatively-prime to
>a(m) as well?