A note on the generalized Josephus problem (Q819265)

Supposing that \(n\) objects, numbered from \(1\) to \(n\), are arranged in a circle, starting with object number \(1\) and counting each object in turn around the circle, clockwise or anticlockwise in the same direction fixed once for all, we eliminate every \(m\)th \((m\geq 2)\) object until all the objects are removed. The \(k\)th Josephus number \(a_m(k, n)\) \((1\leq k\leq n)\) is defined to be equal to \(\ell\) \((1\leq\ell\leq n)\), if \(\ell\) is the number attached to the object to be removed at the \(k\)th step of reduction. There is plainly \(1\leq a_m(k,n)\leq n\). For a given \(m\geq 1\) in general \(m\) induces a permutation \(\sigma_m= \sigma_{m,n}\) of the array \(\langle 1,2,\dots, n\rangle\), that is the Josephus permutation. There are shown some propositions on Josephus permutations. A generalisation of the Josephus problem is to determine Josephus numbers \(a_m(k, n)\) in which the integers \(m\) may be not necessarily the same in each step of eliminating the \(n\) given objects. It is presented an algorithm for determining the Josephus numbers \(a_m(k, n)\) with an arbitrarily given sequence \((m)= (m_1,m_2,m_3,\dots)\) of positive integers.