Sylvester's problem: minimal number of ordinary lines through n points in the plane.
A003034
Sylvester's problem: minimal number of ordinary lines through n points in the plane.
Terms
- a(0) =3a(1) =3a(2) =4a(3) =3a(4) =3a(5) =4a(6) =6a(7) =5a(8) =6a(9) =6a(10) =6a(11) =7
External references
- oeis: A003034