cp's OEIS Frontend

A299781 Triangle read by rows: T(n,m) = number of k-uniform tilings having m different arrangements of polygons about their vertices, for k = 1..n, with 1 <= m <= n.

%I A299781 #18 Apr 11 2018 06:07:38
%S A299781 11,11,20,11,42,39,11,75,124,33,11,149,273,127,15,11,249,557,314,107,
%T A299781 10,11
%N A299781 Triangle read by rows: T(n,m) = number of k-uniform tilings having m different arrangements of polygons about their vertices, for k = 1..n, with 1 <= m <= n.
%C A299781 Column m lists the partial sums of the m-th column of triangle A299780.
%H A299781 Brian L. Galebach, <a href="http://ProbabilitySports.com/tilings.html">n-Uniform Tilings</a>
%e A299781 Triangle begins:
%e A299781   11;
%e A299781   11,  20;
%e A299781   11,  42,  39;
%e A299781   11,  75, 124,  33;
%e A299781   11, 149, 273, 127,  15;
%e A299781   11, 249, 557, 314, 107, 10;
%e A299781 ...
%Y A299781 Column 1 gives A010850.
%Y A299781 Leading diagonal is A068600.
%Y A299781 Row sums give A299782.
%Y A299781 Cf. A068599, A299780.
%K A299781 nonn,tabl,hard,more
%O A299781 1,1
%A A299781 _Omar E. Pol_, Mar 30 2018