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-1 of 1 results.

A373456 Number of tree interval posets of permutations of size n, considered up to isomorphism.

Original entry on oeis.org

1, 1, 1, 3, 6, 14, 32, 79, 192, 488, 1244, 3240, 8497, 22561, 60309, 162541, 440598, 1201377, 3291426, 9058464, 25027797, 69401101, 193071153, 538724060, 1507288378, 4227824974, 11886150870, 33488522111, 94539554742, 267383598840, 757539956852, 2149698586706, 6109515731611
Offset: 1

Views

Author

Mathilde Bouvel, Jun 06 2024

Keywords

Comments

See Remark 24 in [Bouvel-Cioni-Izart].

References

  • Bridget E. Tenner. Interval Posets of Permutations. Order, 39(3):523-536, 2022.

Crossrefs

For the same posets but not considered up to isomorphism, see A054515.
For interval posets that are not necessarily trees, see A373455 (for posets also considered up to isomorphism) and A348479 (otherwise).

Formula

Asymptotic behavior of a(n) is c*n^(-3/2)*r^n with c approximately 0.2597 and r approximately 2.9784. See M. Bouvel, L. Cioni, B. Izart (Remark 24).
Showing 1-1 of 1 results.