|
Search: id:A064797
|
|
|
| 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. |
|
+0
5
|
|
| 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, 68, 68, 68, 85, 85, 102, 102, 102, 102, 102, 102, 119, 119, 119, 119, 145, 145, 174, 174, 174, 174, 203, 203, 203, 203, 203, 203, 232, 232, 232, 232, 232, 232, 261, 261
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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
|
|
FORMULA
|
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
|
|
EXAMPLE
|
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.
|
|
CROSSREFS
|
Cf. A064764, A035106, A064796.
Cf. A064764, A035106, A064796, A000720, A073818.
Sequence in context: A129902 A087560 A071892 this_sequence A053319 A075779 A065420
Adjacent sequences: A064794 A064795 A064796 this_sequence A064798 A064799 A064800
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas, Oct 21 2001
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Oct 22 2001
a(11)-a(24) from Charles R. Greathouse IV, Jul 23 2006
More terms from Martin Fuller (martin_n_fuller(AT)btinternet.com), Jul 30 2006
|
|
|
Search completed in 0.002 seconds
|
