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

%I A095240
%S A095240 1,2,2,4,4,16,32,48,96,384,3072,9216,36864,46080,184320,483840,3870720,
%T A095240 7741440,82575360,743178240,23781703680,59454259200,475634073600,
%U A095240 2497078886400,39953262182400,22473709977600,85614133248000
%N A095240 Variant of A095236.
%C A095240 In this version, each person, knowing that all people arriving subsequently 
               will also follow rules 1) and 2), chooses his pay-phone so that after 
               the next person arrives, the distances referred to in 1) and 2) will 
               be the maximum possible.
%C A095240 A non-monotonic sequence: a(25) > a(26). Does a(n) > a(n+1) for other 
               values of n?
%e A095240 For example, in a 6-pay-phone situation, person A must pick either pay-phone 
               1 or pay-phone 6.
%Y A095240 Cf. A095236, A095239.
%Y A095240 Sequence in context: A066781 A112869 A086117 this_sequence A110428 A076928 
               A025557
%Y A095240 Adjacent sequences: A095237 A095238 A095239 this_sequence A095241 A095242 
               A095243
%K A095240 nonn
%O A095240 1,2
%A A095240 Matthew Vandermast (ghodges14(AT)comcast.net), Jul 03 2004

Search completed in 0.001 seconds