%I A119862
%S A119862 1,2,6,12,60,3,21,168,504,2520,27720,4,52,364,5460,21840,371280,1113840,
%T A119862 21162960,5,105,2310,53130,212520,1062600,13813800,124324200,7,203,6090,
%U A119862 188790,3020640,33227040,564859680,35,1260,46620,885780,11515140,10,410
%N A119862 Smallest number not yet used that is either a divisor or multiple of 
               both n and a(n-1).
%C A119862 This is apparently the smallest divisor of gcd(n,a(n-1)) not yet used 
               if such exists, or lcm(n,a(n-1)) otherwise. This is a permutation 
               of the positive integers. The required lemma is that there are arbitrarily 
               long sequences where a(n) = lcm(n,a(n-1)).
%Y A119862 Sequence in context: A164859 A152873 A083001 this_sequence A111936 A002805 
               A117481
%Y A119862 Adjacent sequences: A119859 A119860 A119861 this_sequence A119863 A119864 
               A119865
%K A119862 nonn
%O A119862 1,2
%A A119862 Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jul 31 2006