Find sum of first N numbers which has only two set bits!

sid1.py

# give input in single line with spaces
noc = int(raw_input())

for case in xrange(0,noc):
	N = int(raw_input())
	i = 1
	totalFound = 0
	totalSum = 0
	while totalFound != N:
		count = 0
		tmpN = i
		while tmpN:
			tmpN &= (tmpN-1)
			count += 1
			if count > 2:
				break
		if count == 2:
			totalSum += i
			totalFound += 1
		i += 1
	print totalSum