%I A064797
%S A064797 1,2,6,6,12,12,15,15,18,18,24,24,35,35,35,35,44,44,55,55,55,55,68,68,68,
%T A064797 68,68,68,85,85,102,102,102,102,102,102,119,119,119,119,145,145,174,174,
%U A064797 174,174,203,203,203,203,203,203,232,232,232,232,232,232,261,261
%N A064797 Largest integer m such that every permutation (p_1, ..., p_n) of (1, 
               ..., n) satisfies lcm(p_i, p_{i+1}) >= m for some i, 1 <= i <= n, 
               where p_{n+1} = p_1.
%C A064797 Testing a trial value of a(n) is equivalent to searching for a Hamilton 
               cycle in the appropriate graph. - Martin Fuller (martin_n_fuller(AT)btinternet.com), 
               Jul 30 2006
%F A064797 For n >= 3, a(n) >= A073818(pi(n)+1), with equality for 17 <= n <= 250 
               - Martin Fuller (martin_n_fuller(AT)btinternet.com), Jul 30 2006
%e A064797 n=4: we must arrange the numbers 1..4 in a circle so that the max of 
               the lcm of pairs of adjacent terms is minimized. The answer is 1423, 
               with max lcm = 6, so a(4) = 6.
%Y A064797 Cf. A064764, A035106, A064796.
%Y A064797 Cf. A064764, A035106, A064796, A000720, A073818.
%Y A064797 Sequence in context: A129902 A087560 A071892 this_sequence A053319 A075779 
               A140880
%Y A064797 Adjacent sequences: A064794 A064795 A064796 this_sequence A064798 A064799 
               A064800
%K A064797 nonn,nice
%O A064797 1,2
%A A064797 N. J. A. Sloane (njas(AT)research.att.com), Oct 21 2001
%E A064797 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 22 2001
%E A064797 a(11)-a(24) from Charles R. Greathouse IV, Jul 23 2006
%E A064797 More terms from Martin Fuller (martin_n_fuller(AT)btinternet.com), Jul 
               30 2006