This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A064797 #17 Jan 01 2019 06:34:05
%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,
%T A064797 68,68,68,68,85,85,102,102,102,102,102,102,119,119,119,119,145,145,
%U A064797 174,174,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 Hamiltonian cycle in the appropriate graph. - _Martin Fuller_, Jul 30 2006
%F A064797 For n >= 3, a(n) >= A073818(pi(n)+1), with equality for 17 <= n <= 250 - _Martin Fuller_, 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.
%t A064797 Table[Min[Max[LCM@@@Partition[#,2,1,1]]&/@Permutations[Range[n]]], {n,10}] (* _Harvey P. Dale_, Oct 05 2011 *) (* The program takes a long time to run and uses a great deal of memory *)
%Y A064797 Cf. A064764, A035106, A064796, A000720, A073818.
%K A064797 nonn,nice
%O A064797 1,2
%A A064797 _N. J. A. Sloane_, Oct 21 2001
%E A064797 More terms from _Vladeta Jovovic_, Oct 22 2001
%E A064797 a(11)-a(24) from _Charles R Greathouse IV_, Jul 23 2006
%E A064797 More terms from _Martin Fuller_, Jul 30 2006