Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from the 4 vertices and the equally spaced 4*n points placed on the sides of a square when every pair of the 4 + 4*n points are connected by a circle and where the points lie at the ends of the circle's diameter.

A373109

Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from the 4 vertices and the equally spaced 4*n points placed on the sides of a square when every pair of the 4 + 4*n points are connected by a circle and where the points lie at the ends of the circle's diameter.

Terms

    a(0) =8a(1) =4a(2) =40a(3) =76a(4) =20a(5) =60a(6) =492a(7) =304a(8) =56a(9) =20a(10) =88a(11) =1696a(12) =1136a(13) =252a(14) =64a(15) =16a(16) =124a(17) =4196a(18) =3536a(19) =1052a(20) =204a(21) =28a(22) =4a(23) =128a(24) =8940a(25) =7948a(26) =2448a(27) =496a(28) =68a(29) =0

External references