A358556 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A358556

Triangle read by rows: T(n,k) is the number of regions formed when n points are placed along each edge of a square that divide the edges into n+1 equal parts and a line is continuously drawn from the current point to that k points, 2 <= k <= 2*n, counterclockwise around the square until the starting point is again reached.

2, 5, 21, 2, 5, 5, 4, 61, 2, 5, 29, 5, 73, 25, 105, 2, 5, 25, 5, 5, 31, 141, 11, 157, 2, 5, 5, 5, 85, 5, 153, 4, 25, 61, 229, 2, 5, 25, 5, 73, 33, 5, 15, 245, 71, 297, 22, 317, 2, 5, 25, 5, 65, 29, 165, 5, 269, 81, 333, 25, 385, 109, 401, 2, 5, 5, 5, 61, 5, 153, 16, 5, 91, 377, 4, 449, 125, 61, 37, 509, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

The starting point can be any of the 4*n points around the square as changing the starting point simply rotates and/or reflects the resulting pattern formed by the path to one of the four orthogonal directions around the square; this does not change the number of regions formed by the path.

The number of times the path formed by the line touches and leaves the edges of the square is lcm(4*n,k)/k. For k >= n this is the number of points in the star-shaped pattern formed by the path.

The table starts with k = 2 as T(n,1) = 5 for all values of n. The maximum k is 2*n as T(n,2*n + m) = T(n,2*n - m).

LINKS

Table of n, a(n) for n=1..81.

Scott R. Shannon, Table for n=1..50.

Scott R. Shannon, Image for T(2,3) = 21.

Scott R. Shannon, Image for T(4,6) = 25.

Scott R. Shannon, Image for T(7,9) = 245.

Scott R. Shannon, Image for T(10,19) = 629.

Scott R. Shannon, Image for T(11,20) = 55.

Scott R. Shannon, Image for T(20,11) = 269.

Scott R. Shannon, Image for T(20,30) = 25.

Scott R. Shannon, Image for T(20,31) = 2277.