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 A067169 #11 Mar 31 2012 10:22:54 %S A067169 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2,0,0,0,0,0,2,0,0,0,1,0,0,1, %T A067169 0,0,5,1,3,2,1,0,3,1,2,1,2,1,3,0,3,1,6,4,3,0,2,2,9,3,1,2,6,3,10,1,5,1, %U A067169 15,1,8,1,10,4,11,1,11,4,15,4,15,3,17,5,14,9,10,3,10,8,20,9,18,6,13,4,12 %N A067169 A067157(n)/n. %D A067169 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 A067169 Sascha Kurz, <a href="http://www.mathe2.uni-bayreuth.de/sascha/oeis/drawing/drawing.html">m-gons in regular n-gons</a> %H A067169 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 A067169 <a href="/index/Pol#Poonen">Sequences formed by drawing all diagonals in regular polygon</a> %Y A067169 Cf. A067157. %K A067169 easy,nonn %O A067169 11,19 %A A067169 _Sascha Kurz_, Jan 06 2002