I know that the vertices of a regular $n$-gon determines the total of $n$ different slopes. We nest the total of $m \in \mathbb{N}$ polygons by drawing a $(1/2)n$-gon inscribed inside the original polygon (for example, an equilateral triangle inside a regular hexagon, a square inside of a regular octagon and so on). We repeat this for every nested polygon.
Now, if we are given $m$ nested polygons, is there a formula for determining the total number of slopes in this configuration?
Slopes in the regular hexagon are defined by drawing a line from each point in the hexagon to every other point in the hexagon. By adding another hexagon, we draw a line from each point in the new hexagon to every other point in the configuration, including the pre-existing points.
Below is an example of $2$ nested hexagons.