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 A361957 #13 Apr 03 2023 21:09:24
%S A361957 1,0,1,0,1,1,0,1,2,1,0,1,5,3,1,0,1,12,10,4,1,0,1,35,35,16,5,1,0,1,108,
%T A361957 149,66,23,6,1,0,1,393,755,327,106,31,7,1,0,1,1666,4736,1936,566,156,
%U A361957 40,8,1,0,1,8543,37394,14130,3578,878,217,50,9,1
%N A361957 Triangle read by rows: T(n,k) is the number of unlabeled tiered posets with n elements and height k.
%C A361957 A tiered poset is a partially ordered set in which every maximal chain has the same length.
%H A361957 Andrew Howroyd, <a href="/A361957/b361957.txt">Table of n, a(n) for n = 0..860</a> (rows 0..40).
%H A361957 Andrew Howroyd, <a href="/A361957/a361957.gp.txt">PARI Program</a>, Apr 2023.
%e A361957 Triangle begins:
%e A361957 1;
%e A361957 0, 1;
%e A361957 0, 1, 1;
%e A361957 0, 1, 2, 1;
%e A361957 0, 1, 5, 3, 1;
%e A361957 0, 1, 12, 10, 4, 1;
%e A361957 0, 1, 35, 35, 16, 5, 1;
%e A361957 0, 1, 108, 149, 66, 23, 6, 1;
%e A361957 0, 1, 393, 755, 327, 106, 31, 7, 1;
%e A361957 0, 1, 1666, 4736, 1936, 566, 156, 40, 8, 1;
%e A361957 ...
%o A361957 (PARI) \\ See link for program code.
%o A361957 { my(A=A361957tabl(9)); for(i=1, #A, print(A[i, 1..i])) }
%Y A361957 Row sums are A361912.
%Y A361957 Column k=2 is A055192.
%Y A361957 The labeled version is A361956.
%Y A361957 Cf. A361953, A361958 (connected).
%K A361957 nonn,tabl
%O A361957 0,9
%A A361957 _Andrew Howroyd_, Apr 03 2023