A224298 Number of permutations in S_n containing exactly 3 increasing subsequences of length 4.

0, 0, 0, 0, 0, 10, 196, 2477, 25886, 244233, 2167834, 18510734, 154082218, 1260811144, 10198142484, 81848366557, 653537296202, 5201485318177, 41321901094750, 327996498249202

Offset: 1

Author

Brian Nakamura, Apr 03 2013

Keywords

• nonn

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.

Links

• B. Nakamura and D. Zeilberger, Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes

Crossrefs

Cf. A005802, A217057, A224249.

Programs

Maple

# programs can be obtained from the Nakamura and Zeilberger link.