login
A292105
Irregular triangle read by rows: T(n,k) = the number of interior points that are the intersections of exactly k chords in the configuration A006561(n) (n >= 1, k >= 1).
8
0, 0, 0, 0, 1, 0, 5, 0, 12, 1, 0, 35, 0, 40, 8, 1, 0, 126, 0, 140, 20, 0, 1, 0, 330, 0, 228, 60, 12, 0, 1, 0, 715, 0, 644, 112, 0, 0, 0, 1, 0, 1365, 0, 1168, 208, 0, 0, 0, 0, 1, 0, 2380, 0, 1512, 216, 54, 54, 0, 0, 0, 1, 0, 3876, 0, 3360, 480, 0, 0, 0, 0, 0, 0, 1, 0, 5985
OFFSET
1,7
LINKS
B. Poonen and M. Rubinstein, The number of intersection points made by the diagonals of a regular polygon, arXiv:math/9508209 [math.MG], 1995-2006, which has fewer typos than the SIAM version.
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 (1998). [Copy on SIAM web site]
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). [Copy on B. Poonen's web site]
N. J. A. Sloane, Three (No, 8) Lovely Problems from the OEIS, Experimental Mathematics Seminar, Rutgers University, Oct 05 2017, Part I, Part 2, Slides. (Mentions this sequence)
Scott R. Shannon, Table for n=1..100.
Scott R. Shannon, Image of 8-gon.
Scott R. Shannon, Image of 9-gon.
Scott R. Shannon, Image of 12-gon.
EXAMPLE
Triangle begins:
0;
0;
0;
0, 1;
0, 5;
0, 12, 1;
0, 35;
0, 40, 8, 1;
0, 126;
0, 140, 20, 0, 1;
0, 330;
0, 228, 60, 12, 0, 1;
See the attached text file for the first 100 rows.
CROSSREFS
Columns give A292104, A101363 (2n-gon), A101364, A101365.
Row sums give A006561.
Cf. A335102.
Sequence in context: A156550 A208477 A007392 * A052401 A222946 A214121
KEYWORD
nonn,tabf
AUTHOR
N. J. A. Sloane, Sep 14 2017
EXTENSIONS
a(27) and beyond by Scott R. Shannon, May 15 2022
STATUS
approved