Let U be a strictly increasing sequence of integers. By a greedy algor
ithm, every nonnegative integer has a greedy U-representation. The suc
cessor function maps the greedy U-representation of N onto the greedy
U-representation of N + 1. We characterize the sequences U such that t
he successor function associated with U is a left, resp. a right, sequ
ential function. We also show that the odometer associated to U is con
tinuous if and only if the successor function is right sequential. (C)
1997 Academic Press.