

A001252


Number of permutations of order n with the length of longest run equal 4.
(Formerly M2092 N0827)


11



0, 0, 0, 2, 16, 134, 1164, 10982, 112354, 1245676, 14909340, 191916532, 2646100822, 38932850396, 609137502242, 10101955358506, 177053463254274, 3270694371428814, 63524155236581118, 1294248082658393546, 27604013493657933856, 615135860462018980316
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


REFERENCES

F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 262. (Terms for n>=13 are incorrect).
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 and Alois P. Heinz, Table of n, a(n) for n = 1..450 (first 100 terms from Max Alekseyev)
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


CROSSREFS

Cf. A001250, A001251, A001253, A010026, A211318.
Sequence in context: A037727 A037622 A264333 * A067058 A002302 A056662
Adjacent sequences: A001249 A001250 A001251 * A001253 A001254 A001255


KEYWORD

nonn


AUTHOR

N. J. A. Sloane


EXTENSIONS

Corrected and extended by Max Alekseyev at suggestion of Sean A. Irvine, May 04 2012


STATUS

approved



