What is the smallest set of nonzero vectors in $\mathbb F_2^n$ which intersects every 2-dimensional subspace?
For example, for n = 3, the set {001, 010, 011} does the job, and is minimal. For n = 4, {0001,0010,0011,1000,1001,1010,1011} does the job.
This is a special case of the Minimum Hitting Set problem (and equivalently, Minimum Set Cover), which is known to be hard in general. However, it is such a special case that I wonder if more can be said. I have not had much luck finding existing results on the question, and trying to find the numbers by computer power does not seem easy, even for modest values of n. My best results for $n$=5 and $n$=6 are sets of size 16 and 44, respectively, but I am not certain those are minimal. That might suggest A129045, but I know the answer for $n$=7 is much less than 134.
There are obvious generalizations – if you can answer the question for $k$-dimensional subspaces of $\mathbb F_q^n$, so much the better, but the particular case I have mentioned seems like a good starting point to me.
Most of all, I would appreciate links to existing literature! Thanks.