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 A067162 #16 Sep 11 2019 15:49:58 %S A067162 1,2,3,5,7,10,12,16,23,29,34,39,53,62,78,87,110,108,136,163,184,200, %T A067162 242,251,297,318,389,371,449,480,547,563,679,676,759,794,900,958,1079, %U A067162 1093,1225,1261,1353,1398,1602,1613,1730,1794,1953,2055,2253,2244,2450 %N A067162 a(n) = A062361(n)/n. %D A067162 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 A067162 Jean-François Alcover, <a href="/A067162/b067162.txt">Table of n, a(n) for n = 4..100</a> %H A067162 Sascha Kurz, <a href="http://www.mathe2.uni-bayreuth.de/sascha/oeis/drawing/drawing.html">m-gons in regular n-gons</a> %H A067162 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 A067162 <a href="/index/Pol#Poonen">Sequences formed by drawing all diagonals in regular polygon</a> %t A067162 A062361 = Import["https://oeis.org/A062361/b062361.txt", "Table"][[All, 2]]; %t A067162 a[n_] := A062361[[n - 2]]/n; %t A067162 a /@ Range[4, 100] (* _Jean-François Alcover_, Sep 11 2019 *) %Y A067162 Cf. A062361. %K A067162 easy,nonn %O A067162 4,2 %A A067162 _Sascha Kurz_, Jan 06 2002