[seqfan] A new version of the counting intersection points of chords in a circle problem

Neil Sloane njasloane at gmail.com
Sat Aug 5 17:12:47 CEST 2017

The classic problem is, put n equally spaced points around a circle;
draw all the chords; how many intersection points are there? Solved by
Poonen and Rubinstein, see A006561.

In the new problem A290447, the points are on a line.

It should be solvable by the same methods.

Best regards

Neil J. A. Sloane, President, OEIS Foundation.
11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
Phone: 732 828 6098; home page: http://NeilSloane.com
Email: njasloane at gmail.com

More information about the SeqFan mailing list