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.

Showing 1-2 of 2 results.

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.

Original entry on oeis.org

11, 11, 20, 11, 42, 39, 11, 75, 124, 33, 11, 149, 273, 127, 15, 11, 249, 557, 314, 107, 10, 11
Offset: 1

Views

Author

Omar E. Pol, Mar 30 2018

Keywords

Comments

Column m lists the partial sums of the m-th column of triangle A299780.

Examples

			Triangle begins:
  11;
  11,  20;
  11,  42,  39;
  11,  75, 124,  33;
  11, 149, 273, 127,  15;
  11, 249, 557, 314, 107, 10;
...

Links

Crossrefs

Column 1 gives A010850.
Leading diagonal is A068600.
Row sums give A299782.
Cf. A068599, A299780.

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

Original entry on oeis.org

11, 31, 92, 243, 575, 1248
Offset: 1

Views

Author

Omar E. Pol, Mar 30 2018

Keywords

Examples

			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.

Links

Crossrefs

Partial sums of A068599.
Row sums of A299781.
Cf. A068600, A299780.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.