On the (non-)existence of m-cycles for generalized Syracuse sequences
For k ≥ 2, the k-generalized Fibonacci sequence is defined to have the initial k terms 0,0,...,0,1 and be such that each term afterwards is the sum of the k preceding terms. We will prove that the number of solutions of the Diophantine equation (under some weak assumptions) is bounded by an effectively computable constant depending only on c.