|
%I #8 Apr 02 2013 12:39:54
%S 0,0,0,0,0,5,128,2124,29445,373379,4517921,53342405,622358262,
%T 7229196009,83984283157,978558652802,11455522117193,134879815196252,
%U 1598299236441571,19067702481168369
%N Number of permutations in S_n containing exactly 2 increasing subsequences of length 5.
%D 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.
%H B. Nakamura and D. Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/Gwilf.html">Using Noonan-Zeilberger Functional Equations to enumerate (in Polynomial Time!) Generalized Wilf classes</a>
%p # programs can be obtained from the Nakamura and Zeilberger link.
%Y Cf. A047889, A224248.
%K nonn
%O 1,6
%A _Brian Nakamura_, Apr 02 2013
|
