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.

1, 1, 2, 1, 2, 3, 1, 2, 3, 5, 1, 2, 3, 4, 9, 1, 2, 3, 4, 6

Offset

0,3

Links

Table of n, a(n) for n=0..19.

W. Morris and V. Soltan, The Erdos-Szekeres problem on points in convex position - a survey, Bull. Amer. Math. Soc., 37 (No. 4, 2000), 437-458.

Example

Array begins:
1 2 3 5 9 ? ...
1 2 3 4 6 9 ...
1 2 3 4 5 7 ...

Crossrefs

Sequence in context: A238967 A066657 A119444 * A092080 A264482 A193588

Adjacent sequences: A060037 A060038 A060039 * A060041 A060042 A060043

Keyword

tabl,nonn,nice,hard

Author

N. J. A. Sloane, Mar 19 2001

Status

approved