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

A108305 Number of set partitions of {1, ..., n} that avoid 4-crossings.

Original entry on oeis.org

1, 1, 2, 5, 15, 52, 203, 877, 4139, 21119, 115495, 671969, 4132936, 26723063, 180775027, 1274056792, 9320514343, 70548979894, 550945607475, 4427978077331, 36544023687590, 309088822019071
Offset: 0

Views

Author

Keywords

Examples

			There are 4140 partitions of 8 elements, but a(8) = 4139 because the partition (1,5)(2,6)(3,7)(4,8) has a 4-crossing.
		

Crossrefs

Cf. A108304 (k = 3), (this: k = 4), A192126 (k = 5), A192127 (k = 6), A192128 (k = 7).
Cf. A192855.

Extensions

One more value from Burrill et al (2011). - R. J. Mathar, May 25 2025

A366776 Number of 2-distant 5-noncrossing partitions of {1,...,n}.

Original entry on oeis.org

1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975, 678569, 4213546, 27642948, 190866373, 1382340849, 10469739750, 82701857286, 679644668584, 5797647603036, 51228938289039, 467980667203765
Offset: 0

Views

Author

Juan B. Gil, Nov 13 2023

Keywords

Comments

a(n+1) is the binomial transform of A192126.

Examples

			There are 678570 partitions of 11 elements, but a(11)=678569 because the partition (1,7)(2,8)(3,9)(4,10)(5,11)(6) has a 2-distant 5-crossing.
		

References

  • Juan B. Gil and Jordan O. Tirrell, A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions, Discrete Math. 343 (2020), no. 6, 111705, 5 pp.

Crossrefs

Formula

a(n+1) = Sum_{i=0..n} binomial(n,i)*A192126(i).

A192127 Number of set partitions of {1, ..., n} that avoid 6-nestings.

Original entry on oeis.org

1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975, 678570, 4213596, 27644383, 190897649, 1382919174, 10479355676, 82850735298, 681840170501, 5828967784989, 51665915664913, 473990899143781, 4493642492511044, 43959218211619150
Offset: 0

Views

Author

Marni Mishna, Jun 23 2011

Keywords

Comments

This is equal to the number of set partitions of {1, ..., n} that avoid 6-crossings.

Examples

			There are 4213597 partitions of 12 elements, but a(12)=4213597 because the partition {1,12}{2,11}{3,10}{4,9}{5,8}{6,7} has a 6-nesting.
		

Crossrefs

Showing 1-3 of 3 results.