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.

A387004 Triangle read by rows: T(n,d) is the number of free, properly d-dimensional (d,2)-polyominoids of size n, 2 <= d <= n+1.

Original entry on oeis.org

1, 1, 1, 2, 7, 3, 5, 49, 41, 8
Offset: 1

Views

Author

Pontus von Brömssen, Aug 14 2025

Keywords

Examples

			Triangle begins:
  n\d| 2  3  4  5
  ---+-----------
  1  | 1
  2  | 1  1
  3  | 2  7  3
  4  | 5 49 41  8
		

Crossrefs

Cf. A000105 (column d=2), A049430 (polyominoes), A365566 (polysticks), A387002 (fixed), A387003, A387005 (row sums).

Formula

T(n,d) = A387003(n,d) - A387003(n,d-1) (with A387003(n,1) = 0).

A387003 Triangle read by rows: T(n,d) is the number of free (d,2)-polyominoids of size n, 2 <= d <= n+1.

Original entry on oeis.org

1, 1, 2, 2, 9, 12, 5, 54, 95, 103
Offset: 1

Views

Author

Pontus von Brömssen, Aug 14 2025

Keywords

Comments

If d > n+1, there are T(n,n+1) such polyominoids. The triangle only includes the values for d <= n+1.

Examples

			Triangle begins:
  n\d| 2  3  4   5
  ---+------------
  1  | 1
  2  | 1  2
  3  | 2  9 12
  4  | 5 54 95 103
		

Crossrefs

Columns: A000105 (d=2), A075679 (d=3), A366334 (d=4).
Cf. A330891 (polyominoes), A385583 (polysticks), A385715 (fixed), A387002, A387004, A387005 (main diagonal).

Formula

T(n,d) = Sum_{k=1..d} A387004(n,k).
Showing 1-2 of 2 results.