login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A067162
a(n) = A062361(n)/n.
2
1, 2, 3, 5, 7, 10, 12, 16, 23, 29, 34, 39, 53, 62, 78, 87, 110, 108, 136, 163, 184, 200, 242, 251, 297, 318, 389, 371, 449, 480, 547, 563, 679, 676, 759, 794, 900, 958, 1079, 1093, 1225, 1261, 1353, 1398, 1602, 1613, 1730, 1794, 1953, 2055, 2253, 2244, 2450
OFFSET
4,2
REFERENCES
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.
LINKS
Jean-François Alcover, Table of n, a(n) for n = 4..100
B. Poonen and M. Rubinstein, The number of intersection points made by the diagonals of a regular polygon, SIAM J. on Discrete Mathematics, Vol. 11, No. 1, 135-156 (1998).
MATHEMATICA
A062361 = Import["https://oeis.org/A062361/b062361.txt", "Table"][[All, 2]];
a[n_] := A062361[[n - 2]]/n;
a /@ Range[4, 100] (* Jean-François Alcover, Sep 11 2019 *)
CROSSREFS
Cf. A062361.
Sequence in context: A248578 A062442 A036964 * A002822 A191327 A109598
KEYWORD
easy,nonn
AUTHOR
Sascha Kurz, Jan 06 2002
STATUS
approved