  We explore the cycles and convergence of Generalized Collatz Sequence, where
$3n+1$ in original collatz function is replaced with $3n+k$. We present a
generating function for cycles of GCS and show a particular inheritance
structure of cycles across such sequences. The cycle structure is invariant
across such inheritance and appears more fundamental than cycle elements. A
consequence is that there can be arbitrarily large number of cycles in some
sequences. GCS can also be seen as an integer space partition function and such
partitions along with collatz graphs are inherited across sequences. An
interesting connection between cycles of GCS and certain exponential
Diophantine equations is also presented.
