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 A365566 #8 Jul 17 2025 22:54:10 %S A365566 1,1,1,1,4,2,1,15,12,3,1,54,105,39,6,1,221,863,566,117,11 %N A365566 Triangle read by rows: T(n,d) is the number of inequivalent properly d-dimensional n-polysticks (or polyedges), 1 <= d <= n. %H A365566 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>. %F A365566 T(n,n) = A000055(n+1). %F A365566 T(n,d) = A385583(n,d) - A385583(n,d-1) (with A385583(n,0) = 0). - _Pontus von Brömssen_, Jul 13 2025 %e A365566 Triangle begins: %e A365566 n\d | 1 2 3 4 5 6 %e A365566 ----+--------------------- %e A365566 1 | 1 %e A365566 2 | 1 1 %e A365566 3 | 1 4 2 %e A365566 4 | 1 15 12 3 %e A365566 5 | 1 54 105 39 6 %e A365566 6 | 1 221 863 566 117 11 %Y A365566 Cf. A000055, A049430 (polyominoes), A365565 (row sums), A385582 (fixed), A385583. %K A365566 nonn,tabl,hard,more %O A365566 1,5 %A A365566 _Pontus von Brömssen_, Sep 09 2023