recursion depth problem

[Michael Bentley]

Oops!  Note to self: *ALWAYS* try code before posting to a public  
forum :-(

def binary(val, width):
	print '%10s = the sum of' % val
	for i in [2 ** x for x in range(width - 1, -1, -1)]:
		a = val / i
		print ' ' * 13 + '%s * (2 ** %s)' % (a, width)
		val -= i * a
		width -= 1

binary(233, 8)