Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079106
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079106 Number of permutations of length n containing the minimum number of monotone subsequences of length 5. +0
5
1, 2, 6, 24, 118, 668, 4124, 26328, 165636, 985032, 5323032, 25038288, 97173648, 288576288, 577152576, 577152576, 2855608848, 2330017568, 710429200 (list; graph; listen)
OFFSET

1,2

LINKS

Joseph Myers, The minimum number of monotone subsequences, Electronic J. Combin. 9(2) (2002), #R4.

CROSSREFS

Cf. A079102, A079103, A079104, A079105.

Sequence in context: A082631 A097483 A007405 this_sequence A088713 A135106 A005394

Adjacent sequences: A079103 A079104 A079105 this_sequence A079107 A079108 A079109

KEYWORD

nonn

AUTHOR

Joseph Myers (jsm(AT)polyomino.org.uk), Dec 23 2002

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 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research