This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095240 Variant of A095236, where first two people choose payphones at the ends. 6
 1, 2, 2, 4, 4, 16, 32, 48, 96, 384, 3072, 9216, 36864, 46080, 184320, 483840, 3870720, 7741440, 82575360, 743178240, 23781703680, 59454259200, 475634073600, 2497078886400, 39953262182400, 22473709977600, 85614133248000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A non-monotonic sequence: a(25) > a(26). a(n) > a(n+1) for n = 25, 33, 49, 57, 65, 81, 97, 98, 113, 129, 130, 131, 145, 161, 162, 177, 193, 194, 195, 197, ... - Max Alekseyev, Mar 14 2019 LINKS Max Alekseyev, Table of n, a(n) for n = 1..100 FORMULA For n>1, a(n) = A095239(n-1)/(n-1) * 2. - Max Alekseyev, Mar 14 2019 EXAMPLE For example, in a 6-pay-phone situation, person A must pick either pay-phone 1 or pay-phone 6. CROSSREFS Cf. A095236, A095239. Sequence in context: A066781 A112869 A086117 * A110428 A076928 A286737 Adjacent sequences:  A095237 A095238 A095239 * A095241 A095242 A095243 KEYWORD nonn AUTHOR Matthew Vandermast, Jul 03 2004 EXTENSIONS Edited by Max Alekseyev, Mar 14 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 15 04:23 EST 2019. Contains 329991 sequences. (Running on oeis4.)