|
|
A278823
|
|
4-Portolan numbers: number of regions formed by n-secting the angles of a square.
|
|
4
|
|
|
1, 4, 29, 32, 93, 84, 189, 188, 321, 316, 489, 460, 693, 676, 933, 916, 1205, 1180, 1505, 1496, 1849, 1836, 2229, 2188, 2645, 2616, 3097, 3060, 3577, 3536, 4089, 4064, 4645, 4604, 5237, 5176, 5857, 5808, 6513, 6472, 7201, 7160, 7933, 7900, 8693, 8648, 9497
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
m-Portolan numbers for m>3 (especially m even) are more difficult than m=3 (A277402) because Ceva's theorem doesn't immediately give us a condition for redundant intersections. The values for n <= 23 were found by brute force in Mathematica, as follows:
1. Solve for the coordinates of all intersections between lines within the square, recording multiplicity.
2. Use an elementary Euler's-formula method as in Poonen and Rubinstein 1998 to turn the intersection-count into a region-count.
|
|
LINKS
|
|
|
FORMULA
|
For n = 2k - 1, a(n) is close to 18k^2 - 26k + 9. For n = 2k, a(n) is close to 18k^2 - 26k + 12. The residuals are related to the structure of redundant intersections in the figure.
|
|
EXAMPLE
|
For n=3, the 4*(3-1) = 8 lines intersect to make 12 triangles, 8 kites, 8 irregular quadrilaterals, and an octagon in the middle. The total number of regions a(3) is therefore 12+8+8+1 = 29.
|
|
CROSSREFS
|
3-Portolan numbers (equilateral triangle): A277402.
n-sected sides (not angles): A108914.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|