A299780 Triangle read by rows: T(n,m) = number of n-uniform tilings having m different arrangements of polygons about their vertices, n >= 1 and 1 <= m <= n.

11, 0, 20, 0, 22, 39, 0, 33, 85, 33, 0, 74, 149, 94, 15, 0, 100, 284, 187, 92, 10, 0

Offset: 1

Author

Omar E. Pol, Mar 30 2018

Keywords

• nonn
• tabl
• hard
• more

Comments

Taken from Brian Galebach's square array (see link).

Examples

			Triangle begins:
  11;
   0,  20;
   0,  22,  39;
   0,  33,  85,  33;
   0,  74, 149,  94, 15;
   0, 100, 284, 187, 92, 10;
...
Other known positive terms are T(7,7) = 7, T(8,7) = 20, T(9,8) = 8, T(10,8) = 27 and T(11,9) = 1.
		

Links

• Brian L. Galebach, n-Uniform Tilings
• José Ezequiel Soto Sánchez, Asla Medeiros e Sá, Luiz Henrique de Figueiredo, Acquiring periodic tilings of regular polygons from images, The Visual Computer (2019) Vol. 35, Issue 6-8, 899-907.

Crossrefs

Row sums gives A068599.

Leading diagonal is A068600.

Column 1 gives 11 together with A000004.

Cf. A299781, A299782.