Let f(n) be the number of subsets of {1,} that contain no two consecutive elements. find the recurrence relation satisfied by f(n).

i think there was a typo. you wrote pat brings 3 quarts of ice-cream to the party. each serving of ice-cream is 1 6 quart. how many total servings of ice-cream does pat bring to the party? i think the bold is supposed to be 1/6. so 1 quart of ice cream = 6 servings. 6 * 3 = 18.