doing research for shorkle and learning about fun and exciting things I missed out on in uni: https://oeis.org/A002464/internal

> This sequence is also the solution to the 'toast problem' devised by my house-mates and me as math undergraduates some 27 years ago: Given a toast rack with n slots, how many ways can the slices be removed so that no two consecutive slices are removed from adjacent slots?