proposed
approved
proposed
approved
editing
proposed
Consider the following two-player game: Start with two nonempty piles of counters. Players alternate taking turns consisting of first discarding one of the piles and then dividing the remaining pile into two nonempty piles. The smaller pile may always be discarded; the larger pile may only be discarded if the smaller pile is at least half as large. (Either pile may be discarded if they are equal.) The player who cannot move (because the configuration has reached two piles of one counter each) loses. Then the numbers c for which two piles of size c is a losing configuration (for the player whose turn it is) are exactly T(4,k) for k > 1, together with 1,3,5, and 9. - Glen Whitney, Aug 03 2018
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
aT(A163491(n)-1, A087088(n)-1) = n. - Peter Munn, Jul 16 2020 [corrected Peter Munn, Aug 02 2020]
proposed
editing
editing
proposed
a(A163491(n)-1), , A087088(n)-1)) = n. - Peter Munn, Jul 16 2020 [corrected _Peter Munn_, Aug 02 2020]
approved
editing
reviewed
approved