default search action
"The number of permutations containing exactly one increasing subsequence ..."
John Noonan (1996)
- John Noonan:
The number of permutations containing exactly one increasing subsequence of length three. Discret. Math. 152(1-3): 307-313 (1996)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.