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 A067166 #11 Mar 31 2012 10:22:54 %S A067166 0,0,0,0,0,0,0,1,0,1,1,3,0,1,2,5,0,6,4,3,4,4,0,5,7,13,9,16,5,15,22,17, %T A067166 16,25,9,33,15,38,34,38,25,48,21,54,43,49,50,62,40,54,55,78,31,91,79, %U A067166 101,79,131,75,127,94,139,111,154,154,169,131,191,172,180,156,228,196 %N A067166 A067154(n)/n. %D A067166 B. Poonen and M. Rubinstein, Number of Intersection Points Made by the Diagonals of a Regular Polygon, SIAM J. Discrete Mathematics, Vol. 11, pp. 135-156. %H A067166 Sascha Kurz, <a href="http://www.mathe2.uni-bayreuth.de/sascha/oeis/drawing/drawing.html">m-gons in regular n-gons</a> %H A067166 B. Poonen and M. Rubinstein, <a href="http://math.mit.edu/~poonen/">The number of intersection points made by the diagonals of a regular polygon</a>, SIAM J. on Discrete Mathematics, Vol. 11, No. 1, 135-156 (1998). %H A067166 B. Poonen and M. Rubinstein, <a href="http://math.mit.edu/~poonen/papers/ngon.m">Mathematica programs for these sequences</a> %H A067166 <a href="/index/Pol#Poonen">Sequences formed by drawing all diagonals in regular polygon</a> %Y A067166 Cf. A067154. %K A067166 easy,nonn %O A067166 8,12 %A A067166 _Sascha Kurz_, Jan 06 2002