More permutations based upon themselves

[Leroy Quet]

In case anyone is interested in this topic, I will note I have submitted 
these sequences to the OEIS:

>%S A102398 1,2,3,5,4,8,6,12,7,13,9,18,10
>%N A102398 A permutation of the positive integers where
>a(2n-1) is lowest positive integer not previously in the sequence,
>a(2n) is A102399(n)th lowest positive integer not yet in the sequence,
>where sequence A102399 is this sequence's inverse permutation.
>%Y A102398 A102399
>%O A102398 1
>%K A102398 ,more,nonn,

>%S A102399 1,2,3,5,4,7,9,6,11,13,15,8,10,17
>%N A102399 Inverse permutation of sequence A102398.
>%Y A102399 A102398
>%O A102399 1
>%K A102399 ,more,nonn,


Is there a nonrecursive way to directly generate these permutations?



Also I have submitted this slightly less clever sequence:
:)

>%S A000001 1,2,4,3,5,10,7,14,8,6,11
>%N A000001 a(1) = 1; a(n+1) = GCD(n,a(n))th lowest positive integer not 
>occuring previously in sequence.
>%C A000001 Likely a permutation of the positive integers.
>%O A000001 1
>%K A000001 ,more,nonn,


It seems very likely this is a permutation of the positive integers,
but I am not *certain*.

In this case, should I or someone else go ahead and submit the inverse 
permutation sequence?

thanks,
Leroy Quet