|
Search: id:A095236
|
|
|
| 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?. |
|
+0
8
|
|
| 1, 2, 4, 8, 16, 36, 136, 216, 672, 2592, 10656, 35904, 167808, 426240, 1866240, 15287040, 35573760, 147640320, 1323970560, 3104317440, 64865525760, 352235520000, 1891946004480, 11505792614400
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
