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.

A361957 Triangle read by rows: T(n,k) is the number of unlabeled tiered posets with n elements and height k.

Original entry on oeis.org

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, 149, 66, 23, 6, 1, 0, 1, 393, 755, 327, 106, 31, 7, 1, 0, 1, 1666, 4736, 1936, 566, 156, 40, 8, 1, 0, 1, 8543, 37394, 14130, 3578, 878, 217, 50, 9, 1
Offset: 0

Views

Author

Andrew Howroyd, Apr 03 2023

Keywords

Comments

A tiered poset is a partially ordered set in which every maximal chain has the same length.

Examples

			Triangle begins:
  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,  149,   66,  23,   6,  1;
  0, 1,  393,  755,  327, 106,  31,  7, 1;
  0, 1, 1666, 4736, 1936, 566, 156, 40, 8, 1;
  ...
		

Crossrefs

Row sums are A361912.
Column k=2 is A055192.
The labeled version is A361956.
Cf. A361953, A361958 (connected).

Programs

  • PARI
    \\ See link for program code.
    { my(A=A361957tabl(9)); for(i=1, #A, print(A[i, 1..i])) }

A361959 Number of connected unlabeled tiered posets with n elements.

Original entry on oeis.org

1, 1, 1, 3, 8, 25, 83, 330, 1538, 8834, 63723, 591313, 7180087, 115411088, 2472336977, 70840464484, 2720170935989, 140167035897433, 9702508891845883, 903305670556552694, 113233954374954246849, 19137449587197829494989, 4366006746295284220605007
Offset: 0

Views

Author

Andrew Howroyd, Apr 03 2023

Keywords

Comments

A tiered poset is a partially ordered set in which every maximal chain has the same length.

Crossrefs

Row sums of A361958.
Cf. A361912 (not necessarily connected).

Programs

Showing 1-2 of 2 results.