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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2

%I #18 Apr 11 2018 06:07:38

%S 11,11,20,11,42,39,11,75,124,33,11,149,273,127,15,11,249,557,314,107,

%T 10,11

%N 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 Column m lists the partial sums of the m-th column of triangle A299780.

%H Brian L. Galebach, <a href="http://ProbabilitySports.com/tilings.html">n-Uniform Tilings</a>

%e Triangle begins:

%e 11;

%e 11, 20;

%e 11, 42, 39;

%e 11, 75, 124, 33;

%e 11, 149, 273, 127, 15;

%e 11, 249, 557, 314, 107, 10;

%e ...

%Y Column 1 gives A010850.

%Y Leading diagonal is A068600.

%Y Row sums give A299782.

%Y Cf. A068599, A299780.

%K nonn,tabl,hard,more

%O 1,1

%A _Omar E. Pol_, Mar 30 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)