id:A079104 - OEIS Search Results

Search: id:A079104

Displaying 1-1 of 1 results found.

page 1

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

+0
5

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

	OFFSET	`1,2`
	COMMENT	`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: A055700 A105871 A079105 this_sequence A116705 A116708 A116706` `Adjacent sequences: A079101 A079102 A079103 this_sequence A079105 A079106 A079107`
	KEYWORD	`nonn`
	AUTHOR	`Joseph Myers (jsm(AT)polyomino.org.uk), Dec 23 2002`

page 1

Search completed in 0.002 seconds

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