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.

A385583 Triangle read by rows: T(n,d) is the number of free d-dimensional polysticks of size n.

Original entry on oeis.org

1, 1, 2, 1, 5, 7, 1, 16, 28, 31, 1, 55, 160, 199, 205, 1, 222, 1085, 1651, 1768, 1779
Offset: 1

Views

Author

Pontus von Brömssen, Jul 04 2025

Keywords

Comments

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

Examples

			Triangle begins:
  n\d| 1   2    3    4    5    6
  ---+--------------------------
  1  | 1
  2  | 1   2
  3  | 1   5    7
  4  | 1  16   28   31
  5  | 1  55  160  199  205
  6  | 1 222 1085 1651 1768 1779
		

Crossrefs

Cf. A330891 (polyominoes), A365565 (main diagonal), A365566, A385581 (fixed).
Columns: A019988 (d=2), A365559 (d=3), A365561 (d=4), A365563 (d=5).

Formula

T(n,d) = Sum_{k=1..d} A365566(n,k).