The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A272651 The no-3-in-line problem: maximal number of points from an n X n square grid so that no three lie on a line. 6
 1, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(47) is the first open case. It is conjectured that a(n) < 2n for all sufficiently large n. A000769 has an extensive list of references and links. Comment from Warren D. Smith, May 10 2015: 2n is a trivial upper bound, because if you pick 2n+1 points, then some three must lie on a horizontal line. Apart from the offset this may be the same as A103517. - R. J. Mathar, May 13 2016 LINKS Table of n, a(n) for n=1..46. A. Flammenkamp, Progress in the no-three-in-line problem A. Flammenkamp, Solutions of the no-three-in-line problem CROSSREFS Cf. A000769. Sequence in context: A032583 A175074 A063127 * A103517 A163300 A193175 Adjacent sequences: A272648 A272649 A272650 * A272652 A272653 A272654 KEYWORD nonn,more AUTHOR N. J. A. Sloane, May 10 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 23 21:37 EDT 2023. Contains 365554 sequences. (Running on oeis4.)