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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000487 Number of permutations of length n with exactly two valleys.
(Formerly M5022 N2165)
4
16, 272, 2880, 24576, 185856, 1304832, 8728576, 56520704, 357888000, 2230947840, 13754155008, 84134068224, 511780323328, 3100738912256, 18733264797696, 112949304754176, 680032201605120, 4090088616099840 (list; graph; refs; listen; history; internal format)
OFFSET

5,1

REFERENCES

F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 261.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

R. G. Rieper and M. Zeleke, Valleyless Sequences

FORMULA

G.f.: 16x^5(1-3x)/((1-2x)^3*(1-4x)^2*(1-6x)). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 18 2003

a(n) = (6^n + (2 - 2n)4^n + (2n^2 - 4n - 1)2^n)/32. - Mitchell Harris, Apr 02 2004

CROSSREFS

Cf. A000431, A000517.

Sequence in context: A161595 A144660 A158574 * A197622 A002303 A158610

Adjacent sequences:  A000484 A000485 A000486 * A000488 A000489 A000490

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 18 2003

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

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

Last modified February 17 16:30 EST 2012. Contains 206050 sequences.