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.

A224250 Number of permutations in S_n containing exactly 2 increasing subsequences of length 5.

Original entry on oeis.org

0, 0, 0, 0, 0, 5, 128, 2124, 29445, 373379, 4517921, 53342405, 622358262, 7229196009, 83984283157, 978558652802, 11455522117193, 134879815196252, 1598299236441571, 19067702481168369
Offset: 1

Views

Author

Brian Nakamura, Apr 02 2013

Keywords

References

  • B. Nakamura and D. Zeilberger, Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes, Adv. in Appl. Math. 50 (2013), 356-366.

Crossrefs

Programs

  • Maple
    # programs can be obtained from the Nakamura and Zeilberger link.
Showing 1-1 of 1 results.