Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001089
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001089 Number of permutations of [n] containing exactly 2 increasing subsequences of length 3. +0
4
0, 0, 0, 3, 24, 133, 635, 2807, 11864, 48756, 196707, 783750, 3095708, 12152855, 47500635, 185082495, 719559600, 2793121080, 10830450780, 41965864794, 162539516448, 629399492330, 2437072038302, 9437097796918 (list; graph; listen)
OFFSET

1,4

COMMENT

Noonan and Zeilberger conjecture that a(n) = (59*n^2+117*n+100)/2/n/(2*n-1)/(n+5)*binomial(2*n,n-4).

LINKS

J. Noonan and D. Zeilberger, [math/9808080] The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns

T. Mansour and A. Vainshtein, Counting occurrences of 123 in a permutation.

CROSSREFS

Cf. A003517, A084249.

Sequence in context: A127520 A009134 A009137 this_sequence A069515 A056350 A056344

Adjacent sequences: A001086 A001087 A001088 this_sequence A001090 A001091 A001092

KEYWORD

nonn

AUTHOR

John Thomas Noonan [ noonan(AT)euclid.math.temple.edu ]

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research