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

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079104 Number of permutations of length n containing the minimum number of monotone subsequences of length 4. 4

%I

%S 1,2,6,22,86,306,882,1764,1764,8738,6892,1682,14706,4182,1250,6250,

%T 3750,1250

%N Number of permutations of length n containing the minimum number of monotone subsequences of length 4.

%C Conjectured to equal A079105 (and so have period 3) from a(17) onwards.

%H Joseph Myers, <a href="http://www.combinatorics.org/Volume_9/Abstracts/v9i2r4.html">The minimum number of monotone subsequences</a>, Electronic J. Combin. 9(2) (2002), #R4.

%Y Cf. A079102, A079103, A079105, A079106.

%K nonn

%O 1,2

%A _Joseph Myers_, Dec 23 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified August 28 18:07 EDT 2015. Contains 261154 sequences.