Problem

Source: 2019 Spain Mathematical Olympiad P1

Tags: Spain, Problem Sets, combinatorics



An integer set T is orensan if there exist integers a<b<c, where a and c are part of T, but b is not part of T. Count the number of subsets T of {1,2,...,2019} which are orensan.