login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A224298 Number of permutations in S_n containing exactly 3 increasing subsequences of length 4. 0
0, 0, 0, 0, 0, 10, 196, 2477, 25886, 244233, 2167834, 18510734, 154082218, 1260811144, 10198142484, 81848366557, 653537296202, 5201485318177, 41321901094750, 327996498249202 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

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=1..20.

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. A005802, A217057, A224249.

Sequence in context: A239768 A239769 A152561 * A222499 A097127 A249846

Adjacent sequences:  A224295 A224296 A224297 * A224299 A224300 A224301

KEYWORD

nonn

AUTHOR

Brian Nakamura, Apr 03 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 December 11 21:28 EST 2019. Contains 329937 sequences. (Running on oeis4.)