recursive fabnacci with tail recurrsion

gistfile1.txt

function fab(k) {
	var m = arguments[1] = arguments[1] || 1,
	    n = arguments[2] = arguments[2] || 1

	return k<=2 ? arguments[k] : f(k-1,n,m+n)
}