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

%I #7 Apr 03 2013 12:00:09

%S 0,0,0,0,0,10,196,2477,25886,244233,2167834,18510734,154082218,

%T 1260811144,10198142484,81848366557,653537296202,5201485318177,

%U 41321901094750,327996498249202

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

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

%K nonn

%O 1,6

%A _Brian Nakamura_, Apr 03 2013