let f(n, k) be the # of ways of choosing k integers without replacement from
n consecutive integers so that no two selected are consecutive.
Number of ways of chosing k numbers without replacement from n with no consecutive elements selectedPosted by csguy (#13) 529 days ago (Editorial)
Who Voted for this Story
Indian Social News and Links Network