cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A299782 #15 Apr 11 2018 03:03:10
%S A299782 11,31,92,243,575,1248
%N A299782 a(n) is the total number of k-uniform tilings, for k = 1..n.
%H A299782 Brian L. Galebach, <a href="http://ProbabilitySports.com/tilings.html">n-Uniform Tilings</a>
%e A299782 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 A299782 Partial sums of A068599.
%Y A299782 Row sums of A299781.
%Y A299782 Cf. A068600, A299780.
%K A299782 nonn,hard,more
%O A299782 1,1
%A A299782 _Omar E. Pol_, Mar 30 2018