Just as in the image, imagine that we have $n$ nested hexagons which have subdivided sides just as in the image i.e. the first inner hexagon has no subdivisions, it is just a regular hexagon, the second hexagon nested has its sides divided into two with a point on the center and so on. Hence in general the $n$th hexagon has its edges subdivided into $n$ equal parts.
Now, from the very outer hexagon, from each subdivision point as well as from each vertex we draw a diameter through the center of the hexagon. Does there exist a rule that determines the number of points these diameters must go through if we number points on one edge as $p_0,...,p_n$ where $p_1$ and $p_n$ would be the vertices of the hexagon itself.
Edit: in the image we have a diameter that goes through two subdivision points as well as the center.