login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A224248 Number of permutations in S_n containing exactly one increasing subsequence of length 5. 1
0, 0, 0, 0, 0, 1, 20, 270, 3142, 34291, 364462, 3844051, 40632886, 432715409, 4655417038, 50667480496, 558143676522, 6223527776874, 70228214538096, 801705888742781, 9254554670121572, 107975393459449243, 1272651313142352772, 15145990284267530992 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 02:46 EST 2022. Contains 350481 sequences. (Running on oeis4.)