Search: id:A064796
Results 1-1 of 1 results found.

%I A064796
%S A064796 1,2,6,8,12,15,20,24,30,35,42,48,56,63,72,80,90,99,110,120,132,143,156,
%T A064796 168,182,195,210,224,240,255,272,288,306,323,342,360,380,399,420,440,
%U A064796 462,483,506,528,552,575,600,624,650,675,702,728,756,783,812,840,870
%N A064796 Largest integer m such that every permutation (p_1, ..., p_n) of (1, 
               ..., n) satisfies p_i * p_{i+1} >= m for some i, 1 <= i <= n, where 
               p_{n+1} = p_1.
%C A064796 Conjecture: a(n) = (n+1)(n+3)/4 for odd n, a(n) = (n)(n+4)/4 for even 
               n. - Jud McCranie (j.mccranie(AT)comcast.net), Oct 25 2001
%F A064796 For odd n > 2, a(n) = (n+1)(n+3)/4. For even n > 2, a(n) = n(n+4)/4. 
               - David Wasserman (wasserma(AT)spawar.navy.mil), Aug 19 2002
%e A064796 n=5: we must arrange the numbers 1..5 in a circle so that the max of 
               the products of pairs of adjacent terms is minimized. The answer 
               is 15243, with max product = 12, so a(5) = 12.
%Y A064796 Cf. A064764, A035106, A064797.
%Y A064796 Sequence in context: A153880 A120227 A138626 this_sequence A083769 A057656 
               A084724
%Y A064796 Adjacent sequences: A064793 A064794 A064795 this_sequence A064797 A064798 
               A064799
%K A064796 nonn,nice
%O A064796 1,2
%A A064796 N. J. A. Sloane (njas(AT)research.att.com), Oct 21 2001
%E A064796 More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com) and Vladeta Jovovic 
               (vladeta(AT)eunet.rs), Oct 22 2001
%E A064796 More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 19 
               2002

Search completed in 0.002 seconds