A079104 - OEIS

This site is supported by donations to The OEIS Foundation.

A079104

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

1, 2, 6, 22, 86, 306, 882, 1764, 1764, 8738, 6892, 1682, 14706, 4182, 1250, 6250, 3750, 1250 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	COMMENTS	`Conjectured to equal A079105 (and so have period 3) from a(17) onwards.`
	LINKS	`Joseph Myers, The minimum number of monotone subsequences, Electronic J. Combin. 9(2) (2002), #R4.`
	CROSSREFS	`Cf. A079102, A079103, A079105, A079106.` `Sequence in context: A148497 A206736 A079105 * A116705 A116708 A116706` `Adjacent sequences: A079101 A079102 A079103 * A079105 A079106 A079107`
	KEYWORD	`nonn`
	AUTHOR	`Joseph Myers (jsm(AT)polyomino.org.uk), Dec 23 2002`

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

Last modified February 14 20:38 EST 2012. Contains 205663 sequences.