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!)
A299782 a(n) is the total number of k-uniform tilings, for k = 1..n. 2

%I #15 Apr 11 2018 03:03:10

%S 11,31,92,243,575,1248

%N a(n) is the total number of k-uniform tilings, for k = 1..n.

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

%e For n = 3 there are 11 uniform tilings, 20 2-uniform tilings and 61 3-uniform tilings. The sum of them is 11 + 20 + 61 = 92, so (3) = 92.

%Y Partial sums of A068599.

%Y Row sums of A299781.

%Y Cf. A068600, A299780.

%K nonn,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 24 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)