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.
%I A385583 #6 Jul 06 2025 11:33:35
%S A385583 1,1,2,1,5,7,1,16,28,31,1,55,160,199,205,1,222,1085,1651,1768,1779
%N A385583 Triangle read by rows: T(n,d) is the number of free d-dimensional polysticks of size n.
%C A385583 If d > n, there are T(n,n) such polysticks. The triangle only includes the values for d <= n.
%H A385583 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>.
%F A385583 T(n,d) = Sum_{k=1..d} A365566(n,k).
%e A385583 Triangle begins:
%e A385583 n\d| 1 2 3 4 5 6
%e A385583 ---+--------------------------
%e A385583 1 | 1
%e A385583 2 | 1 2
%e A385583 3 | 1 5 7
%e A385583 4 | 1 16 28 31
%e A385583 5 | 1 55 160 199 205
%e A385583 6 | 1 222 1085 1651 1768 1779
%Y A385583 Cf. A330891 (polyominoes), A365565 (main diagonal), A365566, A385581 (fixed).
%Y A385583 Columns: A019988 (d=2), A365559 (d=3), A365561 (d=4), A365563 (d=5).
%K A385583 nonn,tabl,more
%O A385583 1,3
%A A385583 _Pontus von Brömssen_, Jul 04 2025