Square array T(n,k) (n >= 2, k >= 1) giving smallest positive integer m such that any set of m points in general position in R^n contains k points in convex position, read by antidiagonals.

A060040

Square array T(n,k) (n >= 2, k >= 1) giving smallest positive integer m such that any set of m points in general position in R^n contains k points in convex position, read by antidiagonals.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =2a(5) =3a(6) =1a(7) =2a(8) =3a(9) =5a(10) =1a(11) =2a(12) =3a(13) =4a(14) =9a(15) =1a(16) =2a(17) =3a(18) =4a(19) =6

External references