Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of vertices in the resulting planar graph.

A367322

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of vertices in the resulting planar graph.

Terms

    a(0) =3a(1) =10a(2) =5a(3) =58a(4) =37a(5) =10a(6) =178a(7) =257a(8) =121a(9) =19a(10) =558a(11) =817a(12) =1055a(13) =301a(14) =42a(15) =1255a(16) =2757a(17) =3506a(18) =1753a(19) =708a(20) =57a(21) =2532a(22) =4825a(23) =10410a(24) =6913a(25) =5369a(26) =1145a(27) =135a(28) =4786a(29) =12293

External references