A224248 Number of permutations in S_n containing exactly one increasing subsequence of length 5.

0, 0, 0, 0, 0, 1, 20, 270, 3142, 34291, 364462, 3844051, 40632886, 432715409, 4655417038, 50667480496, 558143676522, 6223527776874, 70228214538096, 801705888742781, 9254554670121572, 107975393459449243, 1272651313142352772, 15145990284267530992

Offset

0,7

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

Table of n, a(n) for n=0..23.

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

Maple

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

Crossrefs

Cf. A047889, A217057.

Sequence in context: A283517 A180799 A021594 * A019793 A021774 A181384

Adjacent sequences: A224245 A224246 A224247 * A224249 A224250 A224251

Keyword

nonn

Author

Brian Nakamura, Apr 02 2013

Status

approved