References to A095236

Given a row of n pay-phones, all initially unused, how many ways are there for n people to choose the pay-phones, assuming each always chooses one of the most distant pay-phones from those in use already?.
1, 2, 4, 8, 16, 36, 136, 216, 672, 2592, 10656, 35904, 167808, 426240, 1866240


1 seqfan posts

Fri Sep 4 14:35:16 CEST 2009    [seqfan] Re: New sequence from XKCD - Urinal protocol

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .