4314240

Appears in sequences

• Triangle T(n,k), n>=3, 3<=k<=n, read by rows. Number of ways to make n selections without replacement from a circular array of n unlabeled cells (ignoring rotations and reflection), such that the first selection of a cell adjacent to previously selected cells occurs on the k-th selection.at n=50A249796
• Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m.at n=58A341847
• Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m.at n=62A341847
• Number of maximal matchings in the 3 X n rook graph.at n=7A341848
• Given a row of n payphones (or phone booths), all initially unused, how many ways are there for n people to choose the payphones, assuming each always chooses one of the most distant payphones from those in use already? We consider here only the distance to the closest neighbor (in contrast to A095236).at n=14A358056