Triangular array T(m,n), 1<=n<=m, giving the minimum positive number of deals of m cards into n piles required to collect all cards in the first pile. Each deal tosses all cards from a pile, the last dealt card indicates a pile to deal next, each deal tosses one card consecutively to the first, 2nd, ..., n-th, first, 2nd, ... pile.
A161135
Triangular array T(m,n), 1<=n<=m, giving the minimum positive number of deals of m cards into n piles required to collect all cards in the first pile. Each deal tosses all cards from a pile, the last dealt card indicates a pile to deal next, each deal tosses one card consecutively to the first, 2nd, ..., n-th, first, 2nd, ... pile.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =5a(6) =1a(7) =3a(8) =8a(9) =9a(10) =1a(11) =6a(12) =24a(13) =36a(14) =37a(15) =1a(16) =10a(17) =9a(18) =47a(19) =85a(20) =86a(21) =1a(22) =12a(23) =55a(24) =125a(25) =144a(26) =231a(27) =232a(28) =1a(29) =4
External references
- oeis: A161135