cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A000769 No-3-in-line problem: number of inequivalent ways of placing 2n points on an n X n grid so that no 3 are in a line.

Original entry on oeis.org

0, 1, 1, 4, 5, 11, 22, 57, 51, 156, 158, 566, 499, 1366, 3978, 5900, 7094, 19204
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

This means no three points on any line, not just lines in the X or Y directions.
A000755 gives the total number of solutions (as opposed to the number of equivalence classes).
It is conjectured that a(n)=0 for all sufficiently large n.
Flammenkamp's web site reports that at least one solution is known for all n <= 46 and n=48, 50, 52.
From R. K. Guy, Oct 22 2004: (Start)
I got the no-three-in-line problem from Heilbronn over 50 years ago. See Section F4 in UPINT.
In Canad. Math. Bull. 11 (1968) 527-531, MR 39 #129, Guy & Kelly conjecture that, for large n, at most (c + eps)*n points can be selected, where 3*c^3 = 2*Pi^2, i.e., c ~ 1.87.
As recently as last March, Gabor Ellmann pointed out an error in our heuristic reasoning, which, when corrected, gives 3*c^2 = Pi^2, or c ~ 1.813799. (End)

Examples

			a(3) = 1:
  X X o
  X o X
  o X X

References

  • M. A. Adena, D. A. Holton and P. A. Kelly, Some thoughts on the no-three-in-line problem, pp. 6-17 of Combinatorial Mathematics (Proceedings 2nd Australian Conf.), Lect. Notes Math. 403, 1974.
  • D. B. Anderson, Journal of Combinatorial Theory Series A, V.27/1979 pp. 365 - 366.
  • D. Craggs and R. Hughes-Jones, Journal of Combinatorial Theory Series A, V. 20/1976 pp. 363-364.
  • H. E. Dudeney, Amusements in Mathematics, Nelson, Edinburgh 1917, pp. 94, 222.
  • M. Gardner, Scientific American V236 / March 1977, pp. 139-140.
  • M. Gardner, Penrose Tiles to Trapdoor Ciphers. Freeman, NY, 1989, p. 69.
  • R. K. Guy, Unsolved combinatorial problems, pp. 121-127 of D. J. A. Welsh, editor, Combinatorial Mathematics and Its Applications. Academic Press, NY, 1971.
  • R. K. Guy, Unsolved Problems Number Theory, Section F4.
  • R. K. Guy and P. A. Kelly, The No-Three-Line Problem. Research Paper 33, Department of Mathematics, Univ. of Calgary, Calgary, Alberta, 1968. Condensed version in Canad. Math. Bull. Vol. 11, pp. 527-531, 1968.
  • R. R. Hall, T. H. Jackson, A. Sudberry and K. Wild, Journal of Combinatorial Theory Series A, V.18/1975 pp. 336-341.
  • H. Harborth, P. Oertel and T. Prellberg, Discrete Math. V73/1988 pp. 89-90.
  • T. Kløve, Journal of Combinatorial Theory Series A, V.24/1978 pp. 126-127.
  • T. Kløve, Journal of Combinatorial Theory Series A, V.26/1979 pp. 82-83.
  • K. F. Roth, Journal London Math. Society V.26 / 1951, p. 204.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

Cf. A000755, A000938, A037185, A037186, A037187, A037188, A037189, A047840, A212807, A235453.
See A272651 for the maximal number of no-3-in-line points on an n X n grid, and A277433 for minimal saturated.
Cf. A194136 (triangular grid), A280537 (3D grid, no 4 in plane).

Extensions

a(17) and a(18) from Benjamin Chaffin, Apr 05 2006
Minor edits from N. J. A. Sloane, May 25 2010
Edited by N. J. A. Sloane, Mar 19 2013 at the suggestion of Dominique Bernardi
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.