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.
%I A272651 #18 May 14 2016 03:55:22 %S A272651 1,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48, %T A272651 50,52,54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,88,90,92 %N 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. %C A272651 a(47) is the first open case. %C A272651 It is conjectured that a(n) < 2n for all sufficiently large n. %C A272651 A000769 has an extensive list of references and links. %C A272651 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. %C A272651 Apart from the offset this may be the same as A103517. - _R. J. Mathar_, May 13 2016 %H A272651 A. Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/no3in/readme.html">Progress in the no-three-in-line problem</a> %H A272651 A. Flammenkamp, <a href="http://wwwhomes.uni-bielefeld.de/achim/no3in/table.txt">Solutions of the no-three-in-line problem</a> %Y A272651 Cf. A000769. %K A272651 nonn,more %O A272651 1,2 %A A272651 _N. J. A. Sloane_, May 10 2016