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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000467 Number of permutations of [n] in which the longest increasing run has length 6.
(Formerly M4868 N2083)
6
0, 0, 0, 0, 0, 1, 12, 137, 1602, 19710, 257400, 3574957, 52785901, 827242933, 13730434111, 240806565782, 4452251786946, 86585391630673, 1767406549387381, 37790452850585180, 844817788372455779, 19711244788916894489, 479203883157602851294 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

REFERENCES

Max A. Alekseyev, On the number of permutations with bounded runs length, Arxiv preprint arXiv:1205.4581, 2012. - From N. J. A. Sloane, Oct 23 2012

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

Max Alekseyev, Table of n, a(n) for n = 1..100

CROSSREFS

Column 6 of A008304. Other columns: A000303, A000402, A000434, A000456.

Cf. A001250, A001251, A001252, A001253, A010026, A211318.

Sequence in context: A194013 A189501 A216081 * A059517 A243966 A097167

Adjacent sequences:  A000464 A000465 A000466 * A000468 A000469 A000470

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Edited and extended by Max Alekseyev, May 20 2012

STATUS

approved

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 September 16 19:31 EDT 2014. Contains 246829 sequences.