The marriageable singles sequence represents the number of noncrossing partitions of the finite set {1, ..., n} in which some pair of singleton blocks can be joined while remaining noncrossing. The lonely singles sequence represents the number of all the other noncrossing partitions of the finite set {1, ..., n} and is the difference between the Catalan numbers sequence and the marriageable singles sequence. The first 16 terms of these sequences are given, as well as some of their properties. These sequences appear when one wants to count the number of ways to cross certain road intersections simultaneously.